Design the test programs (CAP) to resolve NP problems (Course Arrangement) with GAs; Based on RECGA, modify the Arithmetic and then conduct tests.
使用遗传算法设计了解决NP类问题(排课问题)的测试程序(CAP)，并根据RECGA对算法进行改进并进行测试。
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问题，需求复杂、约束众多，具有诸如强时间窗约束等特点。
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难度问题这一观点出发，尝试性地将遗传算法用于点注记自动配置。
Biochemical reaction theory based DNA computation is of the massive inherent parallelism, so compared to silicon computer, DNA computer has most superiority out and away on NP problems.
基于生化反应原理的DNA计算具有强大的并行运算能力，DNA计算机在求解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”类问题来说，答案可能很难解得——可能需要数十亿年的时间进行计算——但一旦得到了答案，它很容易检验。
Most of the research in Computer Science these days is devoted to time efficiency, particularly the theoretical time barrier of NP-Complete problems (like the Traveling Salesman problem).
不过现如今的许多计算机科学研究更加关注时间效率，特别是NP完全问题中的理论时间边界(比如旅行商人问题，这是完全NP中一个重要的问题，译者注)。
The Clay Mathematics Institute in Cambridge, MA, has named "P versus NP" as one of its "Millennium" problems, and offers $1 million to anyone who provides a verified proof.
麻省的剑桥克莱数学研究院（Clay Mathematics Institute）将“P 与NP”列为其“千年（Millennium）”问题之一，并为任何作出有效证明的人提供 1 百万美元的奖金。
Solving NP hard problems is always the bottleneck task for computer science and techniques.
求解np难问题一直是计算机科学技术中的一个瓶颈任务。
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
In this paper, the polynimial time algorithms of the NP complete problems are gained in the algebraical and combinatorial two aspects respectively.
本文从代数及组合两个方面论证了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难度的问题得出有价值的近似算法。
There exists many design and optimization problems in network, and parts of them belong to NP type.
网络中存在许多设计和优化问题，其中相当一部分属于NP类型。
Minimum path set and flow allocation problem (MPSFAP) were NP complete problems.
最小路径集和流量分配问题(MPSFAP)是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 security of these new cryptosystems depends on some NP-complete problems in the theory of Diophantine equations and on the difficulty of large number decomposition.
这些体制的安全性依赖于求解丢番图方程中的一些NP完全问题和大数的素因子分解的困难性。
The channel assignment problem belongs to the class of NP complete optimization problems, so we propose a new fixed channel assignment approach based on genetic algorithms.
信道分配问题属于组合优化中的NP完备问题，为此在遗传算法的基础上提出了一种新的固定信道分配方法。
In this paper, hairpin structure and molecular beacons are applied in solving a few NP complete problems.
本文主要给出发夹结构及分子信标在几个NP完全问题中的应用。
We show that both the reverse problems are strongly NP-hard.
我们将证明这两个逆网络选址问题都是强np困难的。
The algorithm complexity analysis shows that, to a certain extent, the algorithm could resolve the NP hard problems of attributive value reduction.
通过算法复杂度分析说明，该算法在一定程度上解决了属性值约简的NP难问题。
In general, constraint satisfaction problems are NP-Complete.
一般而言，约束满足问题是NP完全的。
This article first introduces the basic idea of DNA computation, then presents DNA computing method for solving NP-complete problems.
本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。
SAT problem is the first NP-complete problem and the nucleus of the category of NP-complete problems.
SAT问题是第一个NP-完全问题，并且是一大类NP-完全问题的核心。
The maximum clique problem is one of the classical NP-complete problems from combinatorial optimization.
最大团问题是组合优化中的一个经典的NP -完全问题。
The results indicate that the proposed algorithm can quickly obtain the satisfactory solutions of this type of NP-complete problems.
实验结果表明，该算法能在较短时间内给出这类NP完备问题的满意解。
The results indicate that the proposed algorithm can quickly obtain the satisfactory solutions of this type of NP-complete problems.
实验结果表明，该算法能在较短时间内给出这类NP完备问题的满意解。
应用推荐