When solving problems, it is often possible to break down the problem into smaller parts and also apply a number of patterns to solve the complete problem.
当解决问题时，很有可能要将这个问题拆分为更小的部分并且应用一系列的模式去解决整个问题。
The Guided Troubleshooter, based on the IBM Guided Activity Assistant technology, continues to be an integral part of the complete problem analysis experience.
Guided Troubleshooter基于IBM GuidedActivityAssistant技术，仍然是完整的问题分析体验中不可或缺的一部分。
This course features an extensive reading list, detailed lecture notes and complete problem sets in the assignments section.
本课程有范围广阔的阅读书目、详细的课堂讲稿和作业部分的完整习题集。
Quadratic programming (QP) is an NP complete problem.
二次规划(QP)为NP完全问题。
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的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完全问题。
It belongs to NP complete problem in theory, so it's hard to solve in practical problems.
在理论上属于NP完全问题，在实际问题上很难解决。
The problem of fault detection in general combinational circuits is a NP-complete problem.
组合电路的故障检测问题是一个NP完全问题。
Problems of 3d layout belong to NP-complete problem and problem of combinatory optimization.
三维布局问题属于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-完全问题的核心。
Because the problem was a NP-complete problem, a construction heuristic algorithm was designed to solve the model.
该问题属于一个NP -完全问题，因此设计了构造启发式算法对模型近似求解。
People always expect to find out minimum reduction, but it has already been proved that it is a NP complete problem.
人们总期望找到最小约简，但这已被证明是一个NP完全问题。
Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP-complete problem.
本文研究了带度约束的最小直径应用层网络多播路由问题，提出了解决该问题的启发式遗传算法。
Because TSP is known to be a NP - complete problem in theory, it is too difficult to be solved with traditional optimal methods.
由于TSP问题在理论上属于NP完备问题，很难用一般的算法求解。
QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem.
组播路由问题是一个非线性的组合优化问题，已证明了该问题是NP完全问题。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和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完全问题的锐利工具。
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完全问题，只能利用启发式算法求出近似的最优解。
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)算法。
Task scheduling problem has been proved to be a NP-complete problem in the most of situations, which make heuristic methods to be widely used in the research of scheduling problem.
绝大部分情况下的任务调度问题已经被证明为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完全问题，已被证明在多项式时间内得不到最优值。
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 -完全问题，并简单地分析了它们的复杂性。
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完全问题都具有非常重要的意义。
The problem of minimum cost multicast tree satisfying bandwidth request and delay-constraint in communication network is a NP-complete problem. It is difficult to be solved by traditional methods.
通信网络时延受限且满足带宽要求的最小代价组播树问题是NP完全问题，传统方法难以求解，一般采用启发式方法求解。
The problem of minimum cost multicast tree satisfying bandwidth request and delay-constraint in communication network is a NP-complete problem. It is difficult to be solved by traditional methods.
通信网络时延受限且满足带宽要求的最小代价组播树问题是NP完全问题，传统方法难以求解，一般采用启发式方法求解。
应用推荐