Solving NP hard problems is always the bottleneck task for computer science and techniques.
求解np难问题一直是计算机科学技术中的一个瓶颈任务。
The algorithm complexity analysis shows that, to a certain extent, the algorithm could resolve the NP hard problems of attributive value reduction.
通过算法复杂度分析说明，该算法在一定程度上解决了属性值约简的NP难问题。
It is pointed out that valuable approximate algorithms can be obtained for large Numbers of NP hard problems by following the quasi-physical procedure.
这种拟物的方案可为许多NP难度的问题得出有价值的近似算法。
Meanwhile, for "NP" problems, a solution might be very hard to find — perhaps requiring billions of years' worth of computation — but once found, it is easily checked.
而另一方面，对于“NP”类问题来说，答案可能很难解得——可能需要数十亿年的时间进行计算——但一旦得到了答案，它很容易检验。
In complexity theory, set packing problems is an important NP-hard problem, which is used widely in the fields of scheduling and code optimization.
在复杂性理论中，此问题是一类重要的NP难问题，被广泛应用于调度、代码优化和生物信息学等领域。
The modern scheduling problems are more complex than classical scheduling problems, most of which are NP-hard problems.
这些现代排序问题比经典排序问题更为复杂，绝大多数都是NP-难问题。
It belongs to NP complete problem in theory, so it's hard to solve in practical problems.
在理论上属于NP完全问题，在实际问题上很难解决。
We show that both the reverse problems are strongly NP-hard.
我们将证明这两个逆网络选址问题都是强np困难的。
There are a lot of NP-hard optimization problems in the engineering application, which are difficult to solve by traditional mathematical techniques.
在实际工程应用中有很多优化问题是NP难问题，难以应用传统数学方法来解决。
This article tries to apply genetic algorithms to label point lettering automatically according to the viewpoint that automatic lettering is one of the hard NP problems.
从注记配置是一个NP难度问题这一观点出发，尝试性地将遗传算法用于点注记自动配置。
Great challenges and barriers exist in both theory and practice due to the NP-hard of layout problems in computation complexity and alarming difficulties in the design of spacecraft themselves.
布局问题的NP -困难性和航天器设计本身的巨大复杂性使得该问题的解决既有理论上的开拓性和挑战性，又存在工程实践上的艰难性和复杂性。
Solving NP-hard problems is always the bottleneck task in the field of computer science and technology.
求解np难度问题一直是计算机科学技术的一个瓶颈任务。
Resource allocation and task scheduling of Grid is an NP-hard problem. Ant algorithm has proved to be a kind of effective algorithm to solve this kind of problems.
网格环境下的资源分配与调度是一个NP难问题，蚂蚁算法是解决这类问题的有效算法。
MuSTSP is a kind of NP problems with complex requirements and constraints. It also has some special characteristics, such as hard time window constraints.
多星测控调度问题是一类NP问题，需求复杂、约束众多，具有诸如强时间窗约束等特点。
A universal model, learning-competing one, was established to solve NP-Hard optimization problems, in which local search was focused in learning model and global search in competing model.
建立了一种解决NP难组合优化问题的一般性的模式——学习-竞争模式。其中，“学习模式”侧重于个体局部的搜索；
The optimal static policies are given for single machine. It is proved that the problems are NP-hard for parallel machines.
对单机问题给出了最优静态策略，对平行机证明了问题是NP -难的。
The optimal static policies are given for single machine. It is proved that the problems are NP-hard for parallel machines.
对单机问题给出了最优静态策略，对平行机证明了问题是NP -难的。
应用推荐