The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
This is often called the "hard problem" of consciousness, and seems scientifically intractable - for now.
此即经常所谓之意识“难题”，而且似乎难以科学地予以解释，至少现在还不行。
The key is to restate any hard problem that requires a lot of software into a simple problem that requires much less.
关键是要把一个需要很多编码的困难问题，转换为一个需要较少编码的简单问题。
We assume that, when we're faced with a really hard problem, the best response is to stay focused, to lavish the dilemma with deliberate thought.
我们是这么认为的：当你遇到棘手的问题时，最好的应对办法是集中注意力，在困境中深思熟虑。
This could lead to significant concurrency problems as the first call may change data needed by the second, leading to a very hard problem to trace.
这可能导致重要的并发问题，因为第一个调用可能更改了第二个所需的数据，导致一个很难跟踪的问题。
Maximum power estimation is a NP-hard problem.
最大功耗估计问题是一个NP难题。
Graph Coloring problem (GCP) is an NP hard problem.
图着色问题(GCP)是NP完全问题。
The max-cut problem is a standard NP-hard problem in graph graphic theory.
最大割问题是图论中的一个典型的NP困难问题。
The connected augmentation of weighted graphs is NP hard problem that has been proved.
加权图的连通扩充问题已被证明是NP完全问题。
Strip layout is the key procedure in progressive die design, it is known as a NP hard problem.
级进模工步排样是级进模设计的核心，理论上属NP完全问题。
Copy right Protection of National Folk Culture is a new but hard problem in field of copyright.
民族民间文化的版权保护是版权研究领域中既新颖而又较难的问题。
How to evaluate the threat of air targets on partial unknown attribute value is a hard problem.
如何在空中目标的指标值不完全确定的情况下对目标进行威胁评估，这是一个棘手的问题。
It could help to solve the hard problem in dielectric measurements of dispersed er fluids particles.
利用本方法初步解决了电流变分散颗粒相介电测试的难题。
Optimization of system reliability is a NP hard problem, and people can not find the precise method for result.
系统可靠性优化已被证明是一个NP完全问题，不存在精确的求解方法。
Frequent leakage of mechanical seal of quenching oil circulating pump was a hard problem in ethylene production.
急冷油循环泵的机械密封频繁泄漏是困扰乙烯生产的老难题。
Layout optimization is an NP-hard problem. It also belongs to complex nonlinear constrained optimization problem.
布局优化是NP难问题，也是复杂的非线性约束优化问题。
Residential formation with high density coexists with low living quality. This is a hard problem in house design.
高密度居住形态与低生活质量并存是城市住宅设计所面临的难题之一。
Because the planning problem includes integral constrains and nonlinear constrains, it is always a NP hard 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难问题，获得较为高效的算法是研究的主要目的。
The galloping and ice-shedding of overhead transmission lines is a hard problem, which has been paid great attention to in the world.
架空输电线的覆冰灾害是一个国际上普遍关心的问题。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
整数规划是NP困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
Absrtact: Task scheduling algorithm has been proved to be a NP hard problem in the dynamic, heterogeneous and complicated grid environment.
摘要：在动态、异构的复杂网格环境中，任务调度算法已被证明是一个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难问题，被广泛应用于调度、代码优化和生物信息学等领域。
In order to preserve the region's security and stability, how to strengthen the cooperation relations and solve water crisis becomes a hard problem which t…
如何加强合作、化解水危机，以维护中亚地区的安全与稳定成为中亚各国在新的世纪必须破解的难题。
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难问题，蚂蚁算法是解决这类问题的有效算法。
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难问题，蚂蚁算法是解决这类问题的有效算法。
应用推荐