选择搜索解决方案时要使用的启发式分支。
Pick a branch heuristic to use while searching for a solution.
通过使用所有可搜索部分的子集，可以从搜索中获得所需的结果，并向用户提供所需的结果，而不必采用启发式方法。
By using a subset of all the text-searchable parts, you can obtain the desired result from search and present to the user the expected result, without needing to take an heuristic approach.
在普通的文本和二进制文件中重复的字符序列是很常见的，所以需要有附加的启发式搜索来处理这种情况。
The is the need to produce an addition heuristic to handle the occurrence of repeated sequences of characters which is common in both plain text and binary files.
附加的启发式搜索计算当前位置进行的比较的次数，然后从“良好后缀”移动中减去这个数。
The additional heuristic calculates the number of comparisons made in the current position and subtracts that from the GOOD SUFFIX shift.
该方法给出冲突矩阵表示对象流入流水线的限制，通过启发式搜索寻找面向目标优化的调度策略。
The method gives out the presentation be constrained to objects into pipeline by using collision matrix, and findsout scheduling model with goal-oriented optimization by heuristic search.
这个算法以布线平面上的障碍信息为基础，采用了人工智能中的启发式搜索技术，时空效率很高。
On the basis of obstruction information on a routing plane, this router has a high efficiency in time and and space by using the heuristic technique in artificial intelligence.
用启发式搜索方法自动获取最佳分段数。
The number of segments is automatically computed due to the inherent heuristic searching.
本文给出一个高效的启发式搜索算法和有关证明。
This paper presents an efficient heuristic searching algorithm, along with relative proof.
竞选算法是一种具有并行能力的启发式优化算法，其搜索机制模拟竞选活动中对支持率的追求动机。
Competitive algorithm is a parallel heuristic optimization algorithm, its searching mechanism simulate the pursue motive to the support-rate in the electing activity.
该算法利用网格来构造搜索图，并对它进行启发式搜索来获得运动指令序列。
This algorithm utilizes the grid to construct the search graph, which is heuristically searched to obtain the movement instruction series.
本文研究了启发式搜索中加权技术。
This paper studies the weighting techniques in heuristic search.
详细研究了启发式搜索算法的产生、构造方法、基本类型等几个方面。
The study includes the generation, construction methods and basic types of heuristics search algorithms.
该算法采用新的启发式变异算子和局部搜索算子。
Heuristics mutation operator and local search scheme are designed in the algorithm.
该算法由启发式封闭轮廓搜索算法和基于规则的深度填充算法两部分组成。
The algorithm consists of two parts: a heuristic enclosed contour searching algorithm and a rule based depth fill-in algorithm.
为了提高查询处理器的执行效率，采用启发式规则来搜索最优的多连接表达式并行调度执行计划。
To improve the execution efficiency of the query processors, the authors exploit heuristics to seek the optimum parallel scheduling execution plan for multi-join expressions.
通过启发式搜索算法使增加的额外约束得到最大化满足，从而寻找到符合用户意图的解。
The heuristic searching algorithm maximizes the fitness of the additional constraint set, thereby reaches the final result that can satisfy the user's expectation.
基于生物激励神经网络、滚动窗口和启发式搜索，提出了一种新的完全遍历路径规划方法。
A new approach to complete coverage path planning for mobile robots, which integrates biologically inspired neural network, rolling window and heuristic searching, is presented.
依赖于专家知识建立了大亚湾核电站和秦山第二核电厂换料堆芯装载知识库，在此基础上进行换料堆芯装载方案启发式优化搜索。
The expert knowledge library for Daya Bay and Qinshan phase II NPP has been established based on expert knowledge, and the reload core loading pattern heuristic search is performed with this library.
利用禁忌搜索技术设计启发式算法对模型求解。
The model was resolved with heuristic algorithm based on Tabu search technique.
该算法运用该文提出的非单调启发式模拟退火搜索法实现网络权值和参数的快速搜索。
Based on the search technique of non-monotone heuristic simulated annealing proposed, the algorithm realizes fast search of network weight and parameter.
定向搜索是一种启发式搜索算法，它是对减少内存需求的最佳优先搜索的优化算法。
Beam search is a heuristic search algorithm that is an optimization of best-first search that reduces its memory requirement.
该算法利用问题的邻域知识指导局部搜索，可克服元启发式算法随机性引起的盲目搜索。
The proposed algorithm utilizes neighborhood knowledge to direct its local search procedure which can overcome the blindness or randomness introduced by meta-heuristics.
在一定的假设下，可以把启发式搜索看作一种随机取样的过程，从而可以把统计推断方法引进搜索。
Under certain hypothesis a heuristic search can be considered as a random sampling process. Thus, it is possible to transfer the statistical inference method to the heuristic search.
基于从该位置管理方案获取的全网拓扑信息，采用启发式搜索算法实现最优地理路由。
Based on the whole network topology information obtained by the K-hops clustering location management scheme, it adopts a heuristic search algorithm to realize optimal geo-routing.
在搜索中利用启发式信息，是目前控制搜索方向的主要方法。
Use elicitation method information through search, it's a main method at present to control direction of search.
在搜索中利用启发式信息，是目前控制搜索方向的主要方法。
Use elicitation method information through search, it's a main method at present to control direction of search.
应用推荐