查询词典 Np

It is difficult to deploy QoS routing in hierarchical network because QoSR is NP complete problem and lack of scalability.

然而由于QoSR是NP完全问题，其可扩展性和在层次化网络中如何实施等问题都难以解决。

However, this is an NP-complete problem because of the high-density deployment of wireless sensor networks.

然而， 由于传感器网络的高密度部署，使得该问题成为一个NP-完全问题。

Finally, it analyses the time complexity of the algorithm and researches how it is influenced by culture operator.3、The paper presents the evaluation standard of the GA's application capability. Basing on characters such as continuity, multi-peak, vibration, randomicity as well as large-scale, five functions are selected to test search ability and robustcity of co-evolution algorithm. Finally, it analyses the simulation result and researches the influence of algorithm brought by culture operators.4、Basing on the concept of collection overcast, it researches the task distribution issue and constitutes delaminated math model on task distribution issue. It puts out the co-evolution algorithm of subtask's decomposing. The experiment compare IGA、SGA to CN and validates the efficiency of co-evolution algorithm on the NP completeness issue.5、Being aim at the optimization issue of load of antenna near ground, it combines many GA strategies and puts forward strategic meme. And it puts out co-evolution algorithm of load of antenna design. And it emulates the optimization design of load of antenna near ground. Finally, it valuates the co-evolution algorithm's efficiency on the continuum search issues of multi-variable and multi-peak value.6、Being aiming at the knowledge of image model matching, it adopts single meme and real code. It puts out fast co-evolution matching algorithm strategy. Basing on NPROD resemble measurement, I emulate the indiscrimination model matching and discrimination model matching. Finally, it valuates the co-evolution algorithm's efficiency on the real code and real time search issue.

分析了算法的时间复杂度，研究了文化算子对算法时间复杂度的影响。3、提出了GA的应用性能评价标准，从连续性、多峰性、随机性、振荡性、广域性多个角度出发选择五个测试函数，对共同进化算法的搜索性能和鲁棒性作了函数优化的性能测试，分析了仿真结果，研究了文化算子对算法的影响。4、基于集覆盖的概念，研究了MAS中的任务分配问题，建立了任务分配问题的分层数学模型，给出了子任务分解共同进化算法，实验比较了IGA、SGA、CN，验证了共同进化算法对NP完全问题的有效性。5、针对近地天线加载优化设计问题，结合多种改进GA策略，提出了策略型拟子，给出天线加载设计的共同进化算法，对有耗半空间对称偶极子天线加载优化设计作了仿真实验，验证了共同进化算法对多变量多峰连续搜索问题上的有效性。6、针对图像模板匹配问题的领域知识，采用单类拟子和实数编码，给出快速共同进化匹配算法策略，基于NPROD相似度测度，仿真试验了无差别和有差别模板匹配，验证了共同进化算法对实数编码和实时性搜索问题上的有效性。

The problem of finite precision multiuser decorrelator is formulated as linear bounded integer optimization problem,and the problem is shown to be NP-hard problem.

该文首先分析了应用有限精度序列为解相关矩阵序列的解相关接收机，将有限精度解相关的多用户检测问题归约为线性约束整数优化问题，同时证明此问题为NP-hard问题。

Then the relation between Wp and Np can be obtained by solving the linear formula through integral.

提出了将该线性表达式积分求解，就能得到Wp与Np的三次多项式关系式，并结合大庆油田北一二排西区块详细说明了求解过程。

As the general interval coloring problem is NP-complete, a property of the program, namely the containment of arrays\' live-ranges, is used to decrease the hardness of interval coloring and simplify it as an interval coloring problem for superperfect graph. Based on this, a judgment theorem for optimal interval coloring together with the implementation algorithm is proposed.

由于一般的区间着色问题是NP完全问题，我们利用程序所具有的一个性质，即数组生命周期的包含性来降低区间着色的难度，将一般的区间着色问题简化为超完美图的区间着色问题，并据此提出了实现最优区间着色的判定条件以及实现算法。

A generalization of the problem, the subgraph isomorphism problem, is known to be NP-complete.

一般化的问题，子图同构问题，是已知的NP完全问题。

The graph isomorphism problem is contained in both NP and co-AM.

该图同构问题，载于NP和双方共同上午。

Graph isomorphism ; NP problem ; P problem ; NPC problem ; Graph isomorphism complete

图同构； NP问题； P问题； NPC问题；图同构完备

Since the graph isomorphism problem is neither known to be NP-complete nor to be tractable, researchers have sought to gain insight into the problem by defining a new class GI, the set of problems with a polynomial-time Turing reduction to the graph isomorphism problem.

由于图同构的问题既不是已知的NP完全问题，也不是听话的，研究人员设法深入了解这个问题，确定了一类新基的一系列问题，多项式时间图灵减少的图同构问题。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。