Maximum power estimation is a NP-hard problem.
最大功耗估计问题是一个NP难题。
Test set problem is a NP-hard problem with wide applications.
测试集问题是一个有着广泛应用的NP难问题。
But it is a NP-Hard problem to get the minimal attribute reduction.
但求取任意问题的最小属性集是一个NP难问题。
The max-cut problem is a standard NP-hard problem in graph graphic theory.
最大割问题是图论中的一个典型的NP困难问题。
The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
Layout optimization is an NP-hard problem. It also belongs to complex nonlinear constrained optimization problem.
布局优化是NP难问题，也是复杂的非线性约束优化问题。
It is difficult to solve in large scale because the LRP is a typical NP-hard problem in combinatorial optimization.
由于定位-车辆路线问题是组合优化问题中一个典型的NP难题，大规模时难以精确求解。
The problem of maximizing total weighted satisfaction level for single machine with fuzzy due-date is a NP-hard problem.
单机模糊交货期总加权满意程度最大化问题是一个NP -难问题。
Attribute reduction in rough set theory is a NP-hard problem, which is studied mainly to design a more efficient algorithm.
粗糙集的属性约简是一个NP难问题，获得较为高效的算法是研究的主要目的。
In this paper we propose there efficient arithmetic-weal search, much space search and overall situation search for sowing NP-hard problem.
提出三种有效的快速算法——局部搜索、多空间搜索和全局搜索来解决NP难度问题。
Vehicle routing problem with soft time Windows (VRPSTW) is a variation of vehicle routing problem (VRP), which is a typical NP-hard problem.
带软时间窗的车辆路径问题(VRPSTW)是在基本的车辆路径问题(VRP)上增加了时间窗约束条件的一种变化形式，是一个典型的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难问题，被广泛应用于调度、代码优化和生物信息学等领域。
Analysis of reliability to the complex network is a NP-Hard problem. Searching for simple and accurate approximation algorithms has high application value.
大型复杂网络的可靠性分析都是NP难题，寻求计算简单、准确的近似算法更具应用价值。
As the task allocation problem is a recognized NP-hard problem, constructing effective approximation algorithms ro heuristic algorithms is a research focus.
由于任务分配问题是NP困难问题，构造有效的近似算法或启发式算法是目前研究的热点。
Resource allocation and task scheduling of Grid is an NP-hard problem. Ant algorithm has proved to be a kind of effective algorithm to solve this kind of problems.
网格环境下的资源分配与调度是一个NP难问题，蚂蚁算法是解决这类问题的有效算法。
As a combinatorial optimization problem, three dimension packing problem with multi-constraints is NP-HARD problem. It is very difficult to obtain an optimal solution.
作为一类组合优化问题，多约束条件下的三维装载问题属于NP - Hard问题，其求解也是相当困难的。
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难问题，通常运用各种启发式算法来找到近似最优解。
The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.
最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。
The minimum attributes reduction set is expected to acquire the brief regulated set. This is taken as NP-hard Problem, which can be figured out through the heuristic algorithm.
为了获得简明的规则集，通常希望能找出最小的属性约简集，而求解最小约简是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 -难问题，它不可能在有限的时间内通过穷举搜索来获得其优化解，为此我们设计了一个启发性算法以解决这个问题。
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 black and white salesman problem (BWTSP) is a new NP-hard problem, which can be divided into the undirected BWTSP and the directed BWTSP according to the symmetry of edges in graph.
黑白旅行商问题(BWTSP)是近年来出现的新NP -难解问题，根据图中边是否对称可以分为无向BWTSP和有向BWTSP两种。
In order to deal with the timetable problem, the NP-hard problem, this paper designs a new method by the use of R_timetable, which is based on the character of college courses arrangement.
为了处理课程表问题这个NP完全类问题，根据大学编排课表的特点设计了一种全新的使用r _时刻表的设计方法。
MultiDepot Open Vehicle Routing Problem with soft time windows is a variation of the Vehicle Routing Problem con- strained by multidepot and soft time windows, which is a typical NP-hard problem.
有软时窗约束多车场开放式车辆路径问题是在基本的车辆路径问题上增加了时间窗约束和多车场作业的一种变化形式，是一个典型的NP-难问题。
The fill in problem for graphs is a well known NP hard problem.
图的最小填充问题是熟知的NP-困难问题。
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难题。
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难问题。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
整数规划是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困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
应用推荐