The technology of pipeline is the most frequently used in modern product line. Pipeline problem is a typical NP-complexity problem with a solid background of the project.
流水线作业是现代生产线最常用的技术，流水线调度问题是具有很强工程背景的典型NP完全问题。
The algorithm complexity analysis shows that, to a certain extent, the algorithm could resolve the NP hard problems of attributive value reduction.
通过算法复杂度分析说明，该算法在一定程度上解决了属性值约简的NP难问题。
Based on this equivalent definition of NP , another randomized complexity class is given: SUPER NP .
基于此等价定义，定义了另一个随机复杂性类：SUPERNP 。
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难问题，被广泛应用于调度、代码优化和生物信息学等领域。
In this paper, the NP-complete problem in combination and optimization having been solved with DNA computing is mainly introduced, and the complexity of these methods is analyzed briefly.
主要介绍了目前利用DNA计算已经解决的组合优化中的NP -完全问题，并简单地分析了它们的复杂性。
Great challenges and barriers exist in both theory and practice due to the NP-hard of layout problems in computation complexity and alarming difficulties in the design of spacecraft themselves.
布局问题的NP -困难性和航天器设计本身的巨大复杂性使得该问题的解决既有理论上的开拓性和挑战性，又存在工程实践上的艰难性和复杂性。
Because of the NP complexity of mapping problem, the thesis studies two-step method: optimal scheduling of data flow graph and optimal processor mapping.
考虑到算法映射问题的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 path packing problem is an optimization problem with many important applications. However, it is NP-hard in computational complexity.
图的路包装问题是一类有着重要应用背景的最优化问题，然而它在计算复杂度上是NP-困难的。
The path packing problem is an optimization problem with many important applications. However, it is NP-hard in computational complexity.
图的路包装问题是一类有着重要应用背景的最优化问题，然而它在计算复杂度上是NP-困难的。
应用推荐