Quadratic programming (QP) is an NP complete problem.
二次规划(QP)为NP完全问题。
Traveling salesman problem(TSP) is a NP complete combinatorial optimum problem.
旅行商问题是NP完全的组合优化问题。
It belongs to NP complete problem in theory, so it's hard to solve in practical problems.
在理论上属于NP完全问题，在实际问题上很难解决。
Sequence alignment is a NP Complete problem and a great challenge to any quick and accurate algorithms.
多序列比对问题是NP完全问题，研究快而精确的算法是一个巨大的挑战。
In this paper, hairpin structure and molecular beacons are applied in solving a few NP complete problems.
本文主要给出发夹结构及分子信标在几个NP完全问题中的应用。
The shortest path problem with two additional constraints in transition time and number of edges is NP Complete.
带时间和边数约束的双约束最短路问题是NP完备的。
In this paper, we prove this problem to be a difficult problem that is NP complete through a polynomial reduction.
本文给出了多项式时间规约证明了在一般图上该问题是一个困难问题，即是NP完全的。
People always expect to find out minimum reduction, but it has already been proved that it is a NP complete problem.
人们总期望找到最小约简，但这已被证明是一个NP完全问题。
QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem.
组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。
Moreover, to design a storage scheme for both memory access conflict free and network alignment conflict free is also a NP Complete problem.
另外设计同时满足存储访问无冲突和互联网络无冲突的存储方案设计问题也是一个NP完全问题。
In this paper, the problem to design a conflict free access storage scheme for arbitrary templates set is proved to be a NP Complete problem.
本文证明了为任意模板集设计存储访问无冲突非线性存储方案的问题是一个NP完全问题。
Grid resource scheduling problem is proved to be an NP complete problem, and genetic algorithms are proved to be sharpen tools to solve NP-complete problem.
网格资源调度问题被证明是一个NP完全问题，而遗传算法是解决NP完全问题的锐利工具。
Therefore, it's of great significance to find an effective solution to the layout algorithm of storage space for solving practical problems and NP complete problems.
因此，寻找一种合理有效的解决仓储空间布局问题的算法对于解决实际问题以及求解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完备问题，为此在遗传算法的基础上提出了一种新的固定信道分配方法。
When the number of devices in a layout is more than 15, this problem will turn to a NP complete problem, only by a heuristic algorithm can an approximate optimum solution be found.
当布局设备多于15台的时候，此类问题就变成了NP完全问题，只能利用启发式算法求出近似的最优解。
Research on theories and methods of scheduling problem is a kind of NP - complete problems.
生产调度理论与方法研究是一类NP完全问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和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完全问题和大数的素因子分解的困难性。
Computing the diagnosis action sequence with minimum cost is a NP-Complete problem if diagnosis actions are dependent.
在诊断操作相关的情况下，求解最小代价的诊断操作序列的过程是一个NP完全问题。
This article first introduces the basic idea of DNA computation, then presents DNA computing method for solving NP-complete problems.
本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。
Aiming at the critical areas coverage NP-complete problem in Wireless Sensor Networks (WSN), this paper proposes a critical areas coverage Heuristic Optimization (CACHO) algorithm.
针对无线传感器网络关键区域覆盖NP完全问题，提出一种关键区域覆盖启发式优化(CACHO)算法。
The problem of fault detection in general combinational circuits is a NP-complete problem.
组合电路的故障检测问题是一个NP完全问题。
As the minimum feedback vertex set problem is NP-complete, it is hard to be solved exactly.
最小反馈节点集问题是一个NP完全问题，很难准确求解。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
图的邻强边着色算法是一个NP完全问题。
Minimizing retransmission nodes in broadcasting is equivalent to minimizing connected dominating set in graph theory, and finding a minimum connected dominating set is NP-complete for graphs.
广播过程中最小化参与转发节点数问题与图论中求解最小连通支配集问题等价，而在任意图中求解最小连通支配集是NP完全问题。
No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.
无等待问题是流水车间调度中的一种，是一类典型的NP完全问题，已被证明在多项式时间内得不到最优值。
No-wait flow shop problem is one of flow shop problems, and is a typically NP-complete problem, which means that it is impossible to find the global optimum in polynomial complexity.
无等待问题是流水车间调度中的一种，是一类典型的NP完全问题，已被证明在多项式时间内得不到最优值。
应用推荐