Graph Coloring problem (GCP) is an NP hard problem.
图着色问题(GCP)是NP完全问题。
The fill in problem for graphs is a well known NP hard problem.
图的最小填充问题是熟知的NP-困难问题。
Power network planning is a NP hard problem difficult to be solved.
电网规划是一个较难解决的NP难问题。
Automatic test paper generation is a NP hard problem while restrictions exist.
试题库自动组卷问题是一个NP难题。
The connected augmentation of weighted graphs is NP hard problem that has been proved.
加权图的连通扩充问题已被证明是NP完全问题。
The problem is known as NP hard no matter whether group sub lotting is admissible or not.
无论是对于成组加工情形还是分组情形，该问题都可以被证明是NP困难的。
Solving NP hard problems is always the bottleneck task for computer science and techniques.
求解np难问题一直是计算机科学技术中的一个瓶颈任务。
Optimization of system reliability is a NP hard problem, and people can not find the precise method for result.
系统可靠性优化已被证明是一个NP完全问题，不存在精确的求解方法。
Because the planning problem includes integral constrains and nonlinear constrains, it is always a NP hard problem.
此类规划问题包含有大量的整数规划及非线性约束，因而被广泛认为是一类NP难题。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
整数规划是NP困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
Machines process sequencing problem with due date Windows in NP hard in the strong sense, traditional algorithms usually are not satisfied.
具有窗口式交货期的加工排序问题是一个强np困难问题，传统方法的计算效果往往不能令人满意。
The feature subset selection is an important problem in machine learning, but the optimal feature subset selection is proves to be a NP hard one.
特征子集选择问题是机器学习的重要问题。而最优特征子集的选择是NP困难问题，因此需要启发式搜索指导求解。
The algorithm complexity analysis shows that, to a certain extent, the algorithm could resolve the NP hard problems of attributive value reduction.
通过算法复杂度分析说明，该算法在一定程度上解决了属性值约简的NP难问题。
It is pointed out that valuable approximate algorithms can be obtained for large Numbers of NP hard problems by following the quasi-physical procedure.
这种拟物的方案可为许多NP难度的问题得出有价值的近似算法。
Three dimension packing problem with multi constraints is a complicated combinatorial optimization, and is NP HARD problem. It is difficult to obtain on optimal solution.
多约束条件下的三维装箱问题是一个复杂的组合优化问题，属于NP-HARD问题，其求解是很困难的。
Coloring of conflict graphs has been used in high level synthesis to map operators, values and data transfers onto Shared resources, however, finding a minimum sized coloring is NP hard problem.
高层次综合中通过对冲突围着色方式把操作、变量值、数据传输映射到共享资源中，然而寻找图着色所需的最小颜色数目是个NP难题。
The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
The scheduling Problem that maximize the number of jobs completed in due date window is NP - hard.
使尽量多的工件在其对应交货时间区间内完工的排序问题是NP困难的。
It has been proved that computing most of these new vulnerability parameters are NP-hard.
但已被证明的是计算一般图的这些参数是NP-困难问题。
But it is a NP-Hard problem to get the minimal attribute reduction.
但求取任意问题的最小属性集是一个NP难问题。
In the last, the paper designs and analyses the Graph Theory algorithm and drives a conclusion that the problem of the arranging of curriculum schedule is NP - hard problem.
在文章的最后我们对课表超图的图论算法进行设计与分析，并得出该问题是一个NP难问题。
The problem of maximizing total weighted satisfaction level for single machine with fuzzy due-date is a NP-hard problem.
单机模糊交货期总加权满意程度最大化问题是一个NP -难问题。
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难问题，被广泛应用于调度、代码优化和生物信息学等领域。
But the RWA in mesh networks is a NP-hard problem which can not be solved optimally with exhaustive search in the endurable time. Hence, we designed a heuristic algorithm to solve it.
而格状网络中的RWA是个NP -难问题，它不可能在有限的时间内通过穷举搜索来获得其优化解，为此我们设计了一个启发性算法以解决这个问题。
Finding an optimal scheduling for such an environment is a NP-hard problem, and so heuristic approaches must be used in general to get an optimal approximation solution.
由于在这样的环境中找到一个最优的调度是一个NP难问题，通常运用各种启发式算法来找到近似最优解。
It has been proved the computation of minimal reduction and full reduction both is NP-hard problem, in artificial intelligence the common way is to employ heuristic knowledge to reduce.
研究表明，最小约简的计算和全部约简的求算都是NP问题，在人工智能中，解决这类问题的一般方法是利用启发式信息进行约简。
The minimum distance decoding of linear codes is NP-hard, but some solvable cases exist.
线性分组码的最小距离译码是NP -难问题，但有些情况可解。
The modern scheduling problems are more complex than classical scheduling problems, most of which are NP-hard problems.
这些现代排序问题比经典排序问题更为复杂，绝大多数都是NP-难问题。
Test set problem is a NP-hard problem with wide applications.
测试集问题是一个有着广泛应用的NP难问题。
Test set problem is a NP-hard problem with wide applications.
测试集问题是一个有着广泛应用的NP难问题。
应用推荐