In this paper, hairpin structure and molecular beacons are applied in solving a few NP complete problems.
本文主要给出发夹结构及分子信标在几个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完全问题都具有非常重要的意义。
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中一个重要的问题，译者注)。
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
Research on theories and methods of scheduling problem is a kind of NP - complete problems.
生产调度理论与方法研究是一类NP完全问题。
It belongs to NP complete problem in theory, so it's hard to solve in practical problems.
在理论上属于NP完全问题，在实际问题上很难解决。
Therefore, finding an effective algorithm to solve the container loading problem is quite meaningful to solving the practical problems of container loading and to calculating NP complete problem.
因此，寻找一个有效的解决集装箱装载问题的算法对于解决集装箱装载的实际问题以及求解NP完全问题都具有非常重要的意义。
In general, constraint satisfaction problems are NP-Complete.
一般而言，约束满足问题是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完备问题，为此在遗传算法的基础上提出了一种新的固定信道分配方法。
However, these kinds of problems are NP-Complete, and it is difficult to give optimal solution within a reasonable time limit.
然而，裁剪与装填问题是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完全问题和大数的素因子分解的困难性。
SAT problem is the first NP-complete problem and the nucleus of the category of NP-complete problems.
SAT问题是第一个NP-完全问题，并且是一大类NP-完全问题的核心。
Just as this paper points out, most problems about combination and sequential optimization are in fact NP-complete, so, it's impossible to find a general algorithm to solve all the problem presently.
正如文中所指出的那样，绝大多数组合与时序优化问题，实际上都是NP -完全问题，因而试图给出现实可行的一劳永逸的通用算法在目前是办不到的。
This article first introduces the basic idea of DNA computation, then presents DNA computing method for solving NP-complete problems.
本文主要介绍了DNA计算的基本思想及解决NP完全问题的DNA计算方法。
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完备问题的满意解。
For NP-complete combination optimization problems, there is no efficient algorithm to the solution of the problems. Consequently, heuristic algorithms may be used to solve such type of problems.
对于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完全问题，已被证明在多项式时间内得不到最优值。
The TCNN is extended for solving file assignment problem(FAP), which is of one of the NP-complete problems.
该文还用这种方法求解了属于NP难题的文件分配问题（FAP）。
Since we prove the problems are NP-complete and APX-complete, we propose three heuristic algorithms to solve them.
我们证明了这个问题不仅是NP完全的同时也是APX完全的，因此我们提出了三种启发式算法解决此问题。
In this paper, a class of board welding problems is posed. Some of the problems are proved to be NP-complete.
本文提出了一类拼板问题，并证明它们是NP—完全的。
Problems of 3d layout belong to NP-complete problem and problem of combinatory optimization.
三维布局问题属于NP完全问题和组合最优化问题。
Problems of 3d layout belong to NP-complete problem and problem of combinatory optimization.
三维布局问题属于NP完全问题和组合最优化问题。
应用推荐