In general, constraint satisfaction problems are NP-Complete.
一般而言,约束满足问题是NP完全的。
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
The problem of multipoint network topological design is NP-complete.
多点网络拓扑结构设计问题是NP-完全问题。
The minimal vertex - covering problem of graph is a NP-complete problem of graph theory.
图的最小顶点覆盖问题是图论中的一个NP完全问题。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
图的邻强边着色算法是一个NP完全问题。
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完全问题,很难准确求解。
Problems of 3d layout belong to NP-complete problem and problem of combinatory optimization.
三维布局问题属于NP完全问题和组合最优化问题。
The optimal layout for rectangular part is a NP-complete combinatorial optimization problem.
矩形件优化排料是一类具有NP完全难度的组合优化问题。
The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题,对它的研究有重要的理论意义。
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 TCNN is extended for solving file assignment problem(FAP), which is of one of the NP-complete problems.
该文还用这种方法求解了属于NP难题的文件分配问题(FAP)。
In this paper, a class of board welding problems is posed. Some of the problems are proved to be NP-complete.
本文提出了一类拼板问题,并证明它们是NP—完全的。
Because the problem was a NP-complete problem, a construction heuristic algorithm was designed to solve the model.
该问题属于一个NP -完全问题,因此设计了构造启发式算法对模型近似求解。
Since we prove the problems are NP-complete and APX-complete, we propose three heuristic algorithms to solve them.
我们证明了这个问题不仅是NP完全的同时也是APX完全的,因此我们提出了三种启发式算法解决此问题。
Multiple Sequence alignment (MSA) is a typical NP-Complete problem. Star alignment is an effective algorithm for MSA.
多序列比对(msa)是一个典型的NP完全问题,星比对是一种有效的多序列比对算法。
Computing the diagnosis action sequence with minimum cost is a NP-Complete problem if diagnosis actions are dependent.
在诊断操作相关的情况下,求解最小代价的诊断操作序列的过程是一个NP完全问题。
The vessel stowage planning is not only a complex combination and optimization problem, but also a NP-Complete problem.
大型集装箱船舶配载问题是一个复杂的组合优化问题,而且是一个NP问题。
Based on the NP-complete weak independence problem, a concrete scheme is proposed to exemplify the shared-key signature.
基于NP -完全的弱独立性问题,给出一个具体的签字方案。
However, these kinds of problems are NP-Complete, and it is difficult to give optimal solution within a reasonable time limit.
然而,裁剪与装填问题是NP-完全问题,很难在有限的合理时间内取得最优解。
The results indicate that the proposed algorithm can quickly obtain the satisfactory solutions of this type of NP-complete problems.
实验结果表明,该算法能在较短时间内给出这类NP完备问题的满意解。
This article first introduces the basic idea of DNA computation, then presents DNA computing method for solving NP-complete problems.
本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。
This article first introduces the basic idea of DNA computation, then presents DNA computing method for solving NP-complete problems.
本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。
应用推荐