Certain heuristics can be applied in query rewrite.
在重写查询时，可以应用某些试探法。
These links are built using the standard RUP heuristics.
这些链接是利用标准的RUP试探法构建的。
They used brute-force computation and heuristics for their solutions.
他们用蛮力测试计算和启发法寻找解决方案。
Also, if the heuristics gauged a scenario incorrectly, unwanted behaviors could result.
同样，如果启发式处理错误估测了场景，将导致意料之外的行为。
The resulting query plans are based on data, rather than heuristics, and are thus extremely efficient.
生成的查询计划基于数据，而不是推断，因此非常高效。
Any mathematical algorithms must be supplemented by heuristics.
任何数学演算法必须由直觉来补充。
They used brute -force computation and heuristics for their solutions.
他们用蛮力测试计算和启发法寻找解决方案。
In such cases it is rational to be inconsistent, and heuristics can be adapted to allow for that.
在这样的情况下，一反常态也是合乎理性的，而启发法也可以通过调整以支持这种做法。
Lastly, a simulated annealing algorithm is further used to improve the personification heuristics.
最后，通过引入模拟退火算法来改善拟人启发式算法的结果。
The study includes the generation, construction methods and basic types of heuristics search algorithms.
详细研究了启发式搜索算法的产生、构造方法、基本类型等几个方面。
Therefore, the ruggedness coefficient of the fitness landscape is essential for performance of heuristics.
因此，适应度地貌的粗糙系数决定了启发式算法的求解性能。
Facing vast information, people have to accept some selectively and implement heuristics to make decisions.
面对大量的信息，人们不得不进行有选择性的接收，并依靠启发式做出自己的决策。
On this basis, use the heuristics algorithm to balance resources and optimize the zone outfitting schedule.
在此基础上，采用启发式算法对区域舾装计划进行资源平衡和优化。
There is no algorithm for enumerating every valid URL, although there are many heuristics for finding a lot of them.
虽然有很多方法可以找到许多相关的URL，但却没有罗列每个有效 URL的算法。
Readers on other platforms use a combination of off-screen modeling and heuristics to extract text from GUI applications.
其他平台上的阅读器利用屏幕以外的建模和直观推断的组合来从GUI应用程序中提取文本。
Numerical experiments under small and large scale situations are given to verify efficiencies of the proposed heuristics.
通过在小规模和大规模情形下进行数值实验，验证了启发式算法的有效性。
In this paper, we introduce an algorithm which is using the importance of attribute with heuristics for feature selection.
本文提出一种基于属性重要度的启发式特征选取算法。
Our brains use heuristics and experience to decide what something is, often skipping over unexpected or novel aspects of a scene.
我们的大脑使用启发法和经验来决定某事是什么样子，经常跳过场景中出乎意料或新颖的方面。
A basic interpreter has been implemented and is now used to evaluate cold paths, determined at compilation time using simple heuristics.
我们实现了一个基本的解释器，通过简单的启发式方法在编译期计算代码中不常经过的路径。
This heuristics dovetail the respective strengths of BDD and SAT and circuit structure based methods to solve local signal correlations.
它有效地结合了基于布尔可满足性、BDD和结构等方法各自的优点，可以有效地解决局部信号赋值之间的关联性。
Task scheduling is an important part in Grid computing. As it has been proven to be NP-complete, it is adaptive to be solved by heuristics.
在网格计算中，任务调度是一个重要的组成部分，并被证明为NP完全问题，以启发式方法求解较为适合。
It includes new heuristics to help indexer find header files in projects, and has added index support for implicit references and overloaded operators.
它包括新的启发式应用，以帮助索引器发现项目中的头文件，并增加了对隐式引用和重载操作符的索引支持。
A mathematic model of the rolling batch heuristics is established in this paper, and an improved two phase heuristics is proposed for the problem.
本文建立了一种轧制批量计划问题的数学模型，提出一种改进的两阶段启发式算法，并对其求解。
Use sweep algorithm to build initial solutions, and then, improve the solutions by 3 local search algorithms, such as 2-opt, 1-exchange, cross heuristics.
通过扫描算法构建初始解，应用2优化、1交换、交叉算法3个邻域搜索算法优化初始解。
You can also use some basic heuristics, depending upon the entire team dynamics; that is, who is going to lead the team and what is his or her level of experience?
您还可以根据整个团队的动态变化，使用一些基本的启发式方法，即领导团队的人是谁，他（或她）的经验处于哪一级别？
A few good heuristics based solely on the first few bytes will tell you if a file or stream is likely to be XML, and therefore worth checking further with a parser.
一些基于最初几个字节的较好的启发式方法可以告诉您，一个文件或流是否可能是XML，是否值得让解析器作进一步检查。
Similarity measures usually do not describe the dependencies between problems and corresponding solutions in detail, but only represent a form of a heuristics.
相似度量通常不详细描述问题和对应方案之间的依赖，仅仅表示启发式经验。
UIs for graphical selection and manipulation of pointcuts will benefit from a common set of heuristics that can turn selections and search results into pointcuts.
用于图形选择和切入点操作的 UI将从一些常见的直观推断中受益，这些直观推断能够将选择和搜索结果转换成切入点。
UIs for graphical selection and manipulation of pointcuts will benefit from a common set of heuristics that can turn selections and search results into pointcuts.
用于图形选择和切入点操作的 UI将从一些常见的直观推断中受益，这些直观推断能够将选择和搜索结果转换成切入点。
应用推荐