This paper uses a new heuristic algorithm-IA to solve this problem.
本文将一种新型的启发式算法——免疫算法用于解决该问题。
This article proposes a new heuristic algorithm for capacitated P-median problem.
针对约束p -中位问题的特点，提出了一种新的启发式算法。
A new heuristic algorithm for BBD decomposition based on adjoint graph is proposed.
本文提出一个新的基于伴随图的求bbd分解的启发式算法。
Based on rough sets, a new heuristic algorithm is presented to solve the difficulty.
基于粗集理论，本文提出了一种新的决策表最优特征子集选择的启发式算法。
This paper discussed the path of extension matrix and introduced a new heuristic algorithm.
本文讨论了扩张矩阵的路径，提出了一种抽取模糊规则的启发式算法。
The key point of the system is cutting stock optimization module in which the new heuristic algorithm is used.
其中的关键技术是棒材的下料优化，将基于启发式多级序列线性优化思想的新算法应用到下料优化模块中。
A new heuristic algorithm is presented for constructing low-cost multicast tree with end-to-end delay constraints.
提出了一种满足端到端时延限制的低代价多播路由算法。
And we propose a new heuristic algorithm entitled maximum bottleneck capacity algorithm (MaxBC), which distributes the wavelength loss to the whole networks.
该算法把负载引起的波长损失均衡地分布在网络中，使得链路的信道容量受到的影响更小。
This paper presents a learning problem from positive examples based on multiple valued minimization paradigm. A new heuristic algorithm for the problem is given.
本文基于多值逻辑函数极小化提出一种正例学习问题，并对这一正例学习问题给出一个启发式学习算法。
It also develops a new heuristic algorithm to solve the model, and at the same time a numerical example is given to illustrate the application of the model and its algorithm.
同时设计了启发式求解算法，最后用一简单实例验证了模型及其算法的有效性。
Ant colony algorithm is a new heuristic optimization method and it has many merits.
蚁群算法是一种新型启发式优化算法，具有较多优点。
A new heuristic density-based ant colony clustering algorithm (HDACC) is presented.
提出一种基于密度的启发性群体智能聚类算法。
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 new approach to solve the problem by combining the heuristic algorithm with simulated annealing approach is presented.
应用模拟退火方法并结合启发式算法，给出了求解该模型的一种新方法。
In this paper, we propose a new attributes reduction algorithm based on the significance of attribute dependencies as heuristic information and add a certain variable precision.
粗糙集理论是一种新的数据挖掘算法，文章以属性依赖重要性作为启发信息提出了一种新的属性约简算法，且加入了一定的分类正确度。
A new clustering model is established to determine the number of rolling units, then a two-phase algorithm (heuristic and simulated annealing) is developed to solve it.
建立了确定轧制单元数的一种新的聚类模型，开发出一种有效的两阶段算法(启发式算法和模拟退火算法)求解此问题。
This paper presents a new fast ant heuristic for the QAP, the approximate-backbone guided fast ant colony algorithm (ABFANT).
针对QAP问题，提出了一种新的蚁群算法——近似骨架导向的快速蚁群算法（ABFANT）。
The paper offer a new heuristic attribute reduction algorithm based on conditional granularity entropy, though running an example, we show that this algorithm is effective.
提出了一种基于条件粒度熵的属性约简的启发式算法，通过例子分析，表明该算法是有效的。
Absrtact: Ant colony algorithm is a novel heuristic simulated evolutionary algorithm, provides a new idea for solving complex problems of combination.
摘要：蚁群算法是一种新型的启发式模拟进化算法，为求解各种复杂的组合问题提供了一种新的思路。
A new heuristic dynamic optimal algorithm is presented in this paper to solve the single airport ground-holding problem.
对单机场地面等待问题提出了一种新的启发式动态优化算法。
A new heuristic circuit partitioning approach based on F-M algorithm is presented in this paper.
提出了一种基于F M算法的启发式电路划分新方法。
After that we study on the ordered decision table and propose a new heuristic attribute reduction algorithm based on dominance matrix, whose time complexity is polynomial.
再次，对有序决策表进行了研究，提出了一种基于优势矩阵的启发式属性约简算法。
Many application dilemmas, such as uneven space division, an excessive number of heuristic parameters, poor adaption to dense track scenes, can be avoided by the new algorithm.
新算法能避免空间划分不均匀、算法经验性太强、对密集航迹场景不适应等多种问题。
Ant Colony Optimization (ACO) algorithm is a new swarm intelligence heuristic algorithm.
蚁群算法是一种新兴的群智能算法。
Ant Colony Optimization (ACO) algorithm is a new swarm intelligence heuristic algorithm.
蚁群算法是一种新兴的群智能算法。
应用推荐