NP-Complete

To find the optimal solution is an NP-complete problem in theory .

寻找该类型生产调度的最优解在理论上是NP完全问题。

Three-dimensional Loading problem is a kind of typical NP-complete problem .

三维装箱问题是一类典型的NP-complete问题。

Genetic algorithm is good for solve NP-Complete problem .

已经证明Qos路由是NP完全问题，遗传算法对求解该类问题比较有效。

The problem of multiple sequence alignment is a NP-Complete problem .

多序列比对是一个NP-Complete问题。

Many optimization problems are NP-complete problems .

图论和优化中的许多问题是NP-完全问题，也是科学和工程计算中重要和基本的问题。

The problem of multipoint network topological design is NP-complete .

多点网络拓扑结构设计问题是NP-完全问题。

SAT is well-known as the first proved NP-Complete problem .

SAT是第一个被证明的NP完全问题。

In the areas of computer applications has been proved to be an NP-complete problem .

在计算机应用范畴已经被证明是一个NP完全问题。

We show that the problem above is NP-complete .

并且证明了这个问题是NP&完备的。

Test scheduling is a typical NP-complete problem .

测试调度是一个典型的NP问题。

The optimal layout is a NP-complete combinatorial optimization problem .

同时，优化排料问题也是组合优化领域中一类有代表性的问题，属NP完全问题。

The optimum allocation of process flowchart in a distributed system is an NP-complete problem .

进程流程图在分布式环境下的最优分配是一NP难度问题。

The problem of fault detection in general combinational circuits is a NP-complete problem .

组合电路的故障检测问题是一个NP完全问题。

A NP-Complete problem occurs when the energy factors and the QoS parameters influence each other .

能量因素与QoS各参数的相互影响构成了一个NP完全问题。

Finding a path with multiple independent QoS constraints is an NP-complete problem .

寻找同时满足多个独立的QoS约束的路径是一个NP完全问题。

In general , constraint satisfaction problems are NP-Complete .

一般而言，约束满足问题是NP完全的。

Frequency assignment problems are NP-Complete problems .

频率分配的问题是一个典型的NP-Complete问题。

Generally , heuristics are employed to solve this NP-complete problem .

总的来说，启发式算法常用于解决此类NP-Complete问题。

The bandwidth allocation problem in ATM networks is NP-complete .

ATM网络带宽分配优化问题是NP-完全问题。

The shortest common superstring problem is an NP-complete problem in computer science .

最短公共超串问题是计算机科学中的NP-完全问题。

The graph coloring problem is a well-known NP-complete problem .

图着色问题是著名的NP-完全问题。

In particular , 3D-Matching problem is one of the six basic NP-complete problems .

其中，3D-Matching问题是六个基本NP完全问题之一。

Picture Makeup Optimization is a particular Two-dimensional Cutting Stock Problem , a NP-Complete problem .

图片优化排版是一种特殊的二维下料问题，属于NP-Complete。

This work represents further evidence for the ability of DNA computing to solve NP-complete search problems .

这一工作为DNA计算能解决NP-完全问题提供了更有力的依据。

It is the first NP-complete proposed by Stephen Cook in 1971 .

它是第一个NP完全问题，由StephenCook于1971年提出。

The crossing number of graph , which is an NP-complete problem , has an important theory meaning .

图的交叉数问题属于NP-困难问题，对它的研究有重要的理论意义。

Vehicle routing problem with time windows ( VRPTW ) is an NP-complete optimization problem .

带时间窗口的车辆路径问题（VRPTW）是一个NP-Complete优化问题。

Multi-robot coalition problem is a kind of NP-complete and complicated combinatorial optimization problems .

机器人联盟问题属于NP完全的复杂的组合优化问题。

Solving NP-complete problems by genetic algorithms

遗传算法用于NP完全问题的求解

A kind of NP-complete problem in cam

CAM中一类新的NP完全问题