An early study gave participants abundant time to complete problem solving and word association exercises.
一项早期研究给参与者充裕的时间来解答问题并完成词汇联想训练。
Minimum Steiner tree problem is NP complete problem.
图着色问题是著名的NP-完全问题。
Quadratic programming (QP) is an NP complete problem.
二次规划(QP)为NP完全问题。
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
However, this kind of problem is conjectured to be a 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-完全问题的核心。
Sequence alignment is a NP Complete problem and a great challenge to any quick and accurate algorithms.
多序列比对问题是NP完全问题，研究快而精确的算法是一个巨大的挑战。
The satisfiability of conjunction normal form (abbreviate sat problem) is a typical NP-complete problem.
合取范式可满足性问题(简称SAT问题)是一个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完全问题。
There are a number of classes of mathematical objects for which the problem of isomorphism is a GI-complete problem.
有一些类型的数学对象的问题，这是一个同构起完整的问题。
Multiple Sequence alignment (MSA) is a typical NP-Complete problem. Star alignment is an effective algorithm for MSA.
多序列比对(msa)是一个典型的NP完全问题，星比对是一种有效的多序列比对算法。
Computing the diagnosis action sequence with minimum cost is a NP-Complete problem if diagnosis actions are dependent.
在诊断操作相关的情况下，求解最小代价的诊断操作序列的过程是一个NP完全问题。
The vessel stowage planning is not only a complex combination and optimization problem, but also a NP-Complete problem.
大型集装箱船舶配载问题是一个复杂的组合优化问题，而且是一个NP问题。
Minimum diameter application layer multicast routing with degree constraints has been proved to be a NP-complete problem.
本文研究了带度约束的最小直径应用层网络多播路由问题，提出了解决该问题的启发式遗传算法。
This course features an extensive reading list, detailed lecture notes and complete problem sets in the assignments section.
本课程有范围广阔的阅读书目、详细的课堂讲稿和作业部分的完整习题集。
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完全问题。
Moreover, to design a storage scheme for both memory access conflict free and network alignment conflict free is also a NP Complete problem.
另外设计同时满足存储访问无冲突和互联网络无冲突的存储方案设计问题也是一个NP完全问题。
In this paper, the problem to design a conflict free access storage scheme for arbitrary templates set is 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完全问题，在一定时间内求其精确全局最优解是相当困难的。
Three-dimensional component packing is a combinatorial optimization and NP-complete problem. It is difficult to find its exact global optimum.
三维布局问题属于组合最优化问题和NP完全问题，在一定时间内求其精确全局最优解是相当困难的。
应用推荐