The heuristic function consists of condition possibility of fault and search cost.
以故障条件概率和搜索检测代价组成启发函数。
The fold distance of the heuristic function was used instead of its direct distance.
函数中的直线距离替换为折距，对其进行了改进。
A new heuristic function to build decision trees based on variable precision rough set is proposed.
应用变精度粗糙集理论，提出了一种利用新的启发式函数构造决策树的方法。
This paper proposes a new rough set-based heuristic function called weighted average support heuristic.
提出了一种新的基于粗糙集的启发函数叫做加权平均支持启发函数。
Using pheromone and heuristic function, an ant moving direction can be determined during global searching.
在全局搜索过程中，利用信息素强度和启发式函数确定蚂蚁移动方向。
The running time of iterative-deepening-A~*(IDA~*) algorithm is analyzed with heuristic function of the problem space and the effect of the function is to reduce the actual search depth.
以问题空间上启发值的分布为启发函数的特征来分析迭代延伸A* （IDA~** ）的时间复杂度，使启发函数的作用相当于减小有效的搜索深度。
This paper is focused on the analysis of different heuristic cost functions and introduces a new statement of this function.
本文的重点在于对不同启发式价值函数的分析，并对这种函数作出了崭新的诠释。
This paper discusses how to use the heuristic method of teaching in real variable function.
研讨了如何在实变函数教学中实施启发式教学的问题。
Until now there are many heuristic algorithms to solve function optimization problems.
目前已经有很多启发式算法用于解决函数优化问题。
A route-based variational inequality model and a heuristic algorithm of the dynamic user optimal route choice problem were proposed by the link travel time function.
运用该阻抗函数建立基于路径的动态用户最优路径选择变分不等式模型，给出了该模型的启发式算法。
Focuses on the algorithms of the minimum-delay spanning tree for the application-layer multicast, and proposes an improved BCT-H (balance compact tree-heuristic) algorithms based on strategy function.
文中着重研究构建最小延迟应用层组播树的算法，提出一种基于策略函数构造应用层最小直径组播树的启发式算法BCT - H。
A heuristic algorithm based on evaluation function for UIO sequence generation is proposed, this algorithm can efficiently generate UIO sequence.
提出了一种基于估价函数的启发式生成uio序列的算法，通过分析比较该算法能更有效地产生UIO序列。
The heuristic strategy use the waiting time to be a target function, and partition the state space by minimizing the waiting time for all the processors.
该划分策略将处理器等待时间作为目标函数，通过极小化所有处理器的等待时间来划分和分配状态空间。
The layout of each sequence is fixed by heuristic location algorithm, and then evaluates it by fitness evaluation function, to ensure the good sequence can be preserved in the evolutionary process.
对于每一个待排序列应用启发式定位算法确定其布局，并根据个体适应度评价函数对其布局进行评价，保证在进化过程中良好的排布序列可以保存下来。
The simulation results were substituted in the cost models and annual total costs of separation sequences were estimated, taking account of heuristic cost function.
将模拟结果代入相关的费用计算模型，并利用探试成本函数概念，估算不同切割位置分离序列的年总成本。
This article consists of five parts: search algorithm, flowchart, hash search function, heuristic search, and experimental results.
本文讨论散列算法中一种盐值的选取，并分析比较加与不加盐值所得到的不同的加密效果。
This article consists of five parts: search algorithm, flowchart, hash search function, heuristic search, and experimental results.
本文讨论散列算法中一种盐值的选取，并分析比较加与不加盐值所得到的不同的加密效果。
应用推荐