启发式

With the combination of Improved Adaptive Genetic Algorithm and Improved Bottom-Left heuristic algorithm,the packing of rectangles can be effectively solved.

提出了一种基于环形交叉算子和环形变异算子的自适应遗传算法，并将改进的自适应遗传算法和IBL启发式布局算法相结合，有效地解决了矩形排样优化问题。

To speed up the solution of the problem, a solution method that hybridizes heuristic algorithm with conventional branch and bound method is presented.

文中还讨论了采用启发式算法同传统的分枝定界法相结合以提高问题的求解速度，并给出了一个数值例子。

For the above problem, two heuristic methods and a hybrid optimal algorithm that incorporates the branch and bound method with active schedule constru〓n algorithm are presented Computational results show the effectiveness of these methods.

对上述问题，给出了两个启发式方法和一个将分支定界法和活动调度构造算法相结合的混合最优算法。

By means of Heuristic Search, Branch and Bound method and Voronoi Diagram, the algorithm analyzes occlusion on complicated denture models precisely and quickly, which solved the practical problem in the application of VR technologies in dentistry.

通过推广基于分离轴定理的经典碰撞检测算法，借助启发式搜索、分支定界和Voronoi图等手段，算法可以在较短的时间内对复杂牙列模型完成高精度的定量咬合分析任务，解决了虚拟现实技术在口腔医学领域应用中的实际问题。

This paper describes a fast and efficient Fixed Heuristic Algorithm for unequal circle packing test problem with equilibrium constraint and all best known optimization solutions.

本文针对一类特殊的已知全部最优解的带平衡约束的圆形Packing考题求解，报告了一种基于不适合多边形(No-Fit-Polygon， NFP)的确定性启发式算法(Fixed Heuristic Algorithm，简称FHA)。

It has achieved some success in solving combinational optimization problems.

蚁群算法是一种应用于组合优化问题的启发式搜索算法。

Researches for VSP can promote the development of the theory and method of combinatorial optimization, which is also the basis of building the modern scheduling and commanding system and intelligence transportation system.

论文对VSP的基本问题——旅行商问题的模型与启发式算法进行了分析与总结，为VSP的研究提供了基础。论文在分析纯装或纯卸的非满载VSP的数学模型的基础上，进行了以下研究

Ant Colony Optimization algorithm is a new heuristic algorithm to the combinatorial optimization problem.

蚁群算法是一种新兴的启发式算法。

In this paper, using time Petri nets as specification models, system functionality and timeliness are first verified. Then a heuristic algorithm is proposed to optimize the system energy, which is driven by subtasks' energy-gradients and can be further simplified in the case that TPNs are composable. The experimental results show that the proposed methods can support the high-level low-power synthesis of real-time systems with results close to the optimum one, but with very low time complexities.

以时间Petri网为模型，验证系统功能性和实时性，在此基础上，提出了一种由子任务的能耗变化率驱动的启发式能耗优化算法，并针对一类特殊形式的网模型———可组合时间Petri网，设计了相应的简化算法·实验说明，上述算法时间复杂度低，且优化效果接近最优值，能够为实时系统低能耗高层综合提供有力支持

This paper proposes a heuristic algorithm for attribution reduction based on conditional entropy by the comprehension and analysis of data mining algorithm based on rough set theory.

本文在理解和分析基于粗糙集理论的数据挖掘算法基础上针对属性约简提出了一个基于条件熵的启发式算法。

We will see more and more activist government policies that distinguish economic activities according to the nationality of the actors.

我们将看到越来越多激进的政府政策，这些政策根据企业的国籍来区分经济活动。

If we can prove the independence of an axiomatic system, then we can guarantee the conciseness of this system, ie.

如果能够证明某个一阶谓词系统的独立性，那么就能够保证该系统的建立是精炼的，即没有任何一条公理或推理规则是多余的。