Ant colony algorithm is a new heuristic optimization method and it has many merits.
蚁群算法是一种新型启发式优化算法，具有较多优点。
A heuristic algorithm to assign tasks is given.
提出了一种启发式任务分配算法。
A monolithic model of the lot-sizing and scheduling problem based on the JIT strategy has been proposed in this paper, and a heuristic algorithm using integrated method has been designed to solve it.
文章针对基于JIT思想建立的一种批量计划和作业排序集成问题，建立整体模型，设计了一种启发式算法采用集成方法求求解。
A new heuristic density-based ant colony clustering algorithm (HDACC) is presented.
提出一种基于密度的启发性群体智能聚类算法。
This paper discussed the path of extension matrix and introduced a new heuristic algorithm.
本文讨论了扩张矩阵的路径，提出了一种抽取模糊规则的启发式算法。
A new heuristic optimization algorithm for solving the problem was presented.
提出了解决这类问题的新的启发式优化算法。
A new dynamic heuristic binary decision diagram (BDD) minimization algorithm is proposed.
提出了一种新的动态启发式二叉判定图(BDD)最小化算法。
A heuristic algorithm of creating graph of user sessions identification was presented.
给出了生成此会话识别图的一种启发式算法。
A decomposition heuristic algorithm was developed to solve the single machine total tardiness problem.
为了解决单机总误工问题，提出了一种分解启发式算法。
The experimental results show that the proposed algorithm has a better performance than those of a traditional heuristic algorithm and an existing evolutionary algorithm.
实验结果表明：提出的算法比现有的遗传算法以及传统的启发式方法提供了较好的结果。
Beam search is a heuristic search algorithm that is an optimization of best-first search that reduces its memory requirement.
定向搜索是一种启发式搜索算法，它是对减少内存需求的最佳优先搜索的优化算法。
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.
运用该阻抗函数建立基于路径的动态用户最优路径选择变分不等式模型，给出了该模型的启发式算法。
Competitive algorithm is a parallel heuristic optimization algorithm, its searching mechanism simulate the pursue motive to the support-rate in the electing activity.
竞选算法是一种具有并行能力的启发式优化算法，其搜索机制模拟竞选活动中对支持率的追求动机。
A heuristic algorithm based on conditional information entropy for knowledge reduction is proposed, and the complexity of this algorithm is analyzed.
提出了一种基于条件信息熵的知识约简启发式算法，并指出该算法的时间复杂度是多项式的。
A heuristic algorithm for multiple alignment was developed to more effectively study alternative splicing patterns of eukaryotic genes.
为对真核基因的选择性剪接形式进行准确、快速、有效的研究，提出了一种启发式多序列比对算法。
To compare the results of simulated anneal algorithm on the static RWA problem, a heuristic algorithm is introduced as reference.
为了衡量模拟退火算法解决静态rwa问题的结果，采用了一种启发性算法作为参考。
This article proposes a new heuristic algorithm for capacitated P-median problem.
针对约束p -中位问题的特点，提出了一种新的启发式算法。
The algorithm consists of two parts: a heuristic enclosed contour searching algorithm and a rule based depth fill-in algorithm.
该算法由启发式封闭轮廓搜索算法和基于规则的深度填充算法两部分组成。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.
本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
This paper presents a heuristic algorithm to solve the time tabling problem, which is a parallel and no-go-back method and uses a improved Tabu eearch to get daily feasible timetable.
本文给出了一种解“时间表问题”的启发式算法，从整个时间表的生成过程来说，它是一种并行和无回溯的方法；
Analyzed is up-down algorithm, a heuristic processor allocation algorithm, and improvement of this algorithm is proposed, it shortens mean time to respond.
增减算法是一种启发式的处理机分配算法。对增减算法进行了分析，然后在此基础上对该算法进行了改进，缩短了平均响应时间。
And we propose a new heuristic algorithm entitled maximum bottleneck capacity algorithm (MaxBC), which distributes the wavelength loss to the whole networks.
该算法把负载引起的波长损失均衡地分布在网络中，使得链路的信道容量受到的影响更小。
A typical heuristic algorithm, TDS, can generate optimal schedule in scheduling length under optimality condition.
TDS等典型算法在优化条件下可得到该问题调度长度上的最优解。
A typical heuristic algorithm, TDS, can generate optimal schedule in scheduling length under optimality condition.
TDS等典型算法在优化条件下可得到该问题调度长度上的最优解。
应用推荐