A heuristic algorithm to assign tasks is given.
提出了一种启发式任务分配算法。
The model was resolved with heuristic algorithm based on Tabu search technique.
利用禁忌搜索技术设计启发式算法对模型求解。
This article proposes a new heuristic algorithm for capacitated P-median problem.
针对约束p -中位问题的特点，提出了一种新的启发式算法。
Finally, a heuristic algorithm for rules extraction of decision tree was designed.
以新的属性重要性为启发式信息设计决策树规则提取方法。
Linear Programming optimization model is setup, and a heuristic algorithm is given.
建立了线性规划优化模型，提出了一种启发式算法。
A heuristic algorithm of creating graph of user sessions identification was presented.
给出了生成此会话识别图的一种启发式算法。
This paper discussed the path of extension matrix and introduced a new heuristic algorithm.
本文讨论了扩张矩阵的路径，提出了一种抽取模糊规则的启发式算法。
Based on the complexity of solving the model, two heuristic algorithm is proposed accordingly.
基于求解该模型的复杂性，进而提出了相应的两种启发式解法。
To solve this problem, an effective hereditary heuristic algorithm is developed in this paper.
为求解此类问题，提出了一种有效的遗传启发算法。
We are present a heuristic algorithm of logic synthesis fitted to large number of input variable.
本文给出了适用于大数目输入变量的逻辑综合启发式算法。
Lagrange relaxation heuristic algorithm is designed to solve the model by equivalent transformation.
通过对模型的等价转换，设计了拉格朗日松弛启发式算法来求解模型。
A decomposition heuristic algorithm was developed to solve the single machine total tardiness problem.
为了解决单机总误工问题，提出了一种分解启发式算法。
A quick heuristic algorithm is proposed to solve the pickup and delivery problem with time Windows (PDPTW).
提出了一种解决有时间窗口装卸货问题(PDPTW)的快速启发式算法。
A mathematical model is firstly proposed. Then the greedy heuristic algorithm is applied to solve the model.
首先建立此问题的数学模型，并采用启发式贪心算法对模型进行求解。
In this paper we study heuristic algorithm for restoration based on DXC and optimal assignment of spare capacity.
本文重点讨论基于DXC的启发式网络恢复算法和备用容量的优化分配问题。
To the change of the flow due to failure, it presents a heuristic algorithm to make local improvement for network.
对由故障引起的链路流量的变化，提出了一种启发式算法，该算法对网络进行了局部的改进。
A typical heuristic algorithm, TDS, can generate optimal schedule in scheduling length under optimality condition.
TDS等典型算法在优化条件下可得到该问题调度长度上的最优解。
The novel online heuristic algorithm of representation based on polygonal boundary reduction is presented in detail.
提出了一种新颖的可在线计算的时间序列启发式算法。
The proposed algorithm incorporates the thoughts of heuristic algorithm, randomized algorithm and local optimization.
这种算法结合了启发式算法和随机化算法以及局部寻优的思想。
A new approach to solve the problem by combining the heuristic algorithm with simulated annealing approach is presented.
应用模拟退火方法并结合启发式算法，给出了求解该模型的一种新方法。
The heuristic algorithm will play an original role in solving certain problems which can't be done by theoretical methods.
对于某些难于用理论方法解决的问题，启发式算法可以起到独到的作用。
Following theoretical analysis, an efficent heuristic algorithm combined with the branch-and-bound algorithm was developed.
并通过理论分析提出一种启发式与分枝定界相结合的算法。
The heuristic algorithm is the gain of the execution time. The partitioning model is constructed and the result is searched.
给出了系统划分模型，使用执行时间最少的增益函数启发下一步动作的启发算法。
To compare the results of simulated anneal algorithm on the static RWA problem, a heuristic algorithm is introduced as reference.
为了衡量模拟退火算法解决静态rwa问题的结果，采用了一种启发性算法作为参考。
On the issue of crossing minimization, either time complexity or result of the conventional heuristic algorithm is unsatisfactory.
在层次图边交叉最小化问题上，常规启发算法或者时间复杂度大或者布图效果不佳。
Computation results of a large number of examples have shown that the heuristic algorithm can be used to solve large scale problems.
用大量例题对启发式算法验证的结果表明，对于规模较大的问题可以单独使用本文提出的启发式算法。
The allocating heuristic algorithm ensures the maximum satisfaction of the clients, and the saving algorithm ensures the overall optimization.
通过分派启发式算法保证最大程度地满足客户的要求，再利用节约算法保证了全局最优。
The allocating heuristic algorithm ensures the maximum satisfaction of the clients, and the saving algorithm ensures the overall optimization.
通过分派启发式算法保证最大程度地满足客户的要求，再利用节约算法保证了全局最优。
应用推荐