查询词典 Np

Hence all the overt LI constructions beyond IP are non-transferable, including some L2-allowed constructions such as the accusative NP beyond IP.

因而，所有IP外显性的一语结构都不会在初始阶段迁移，包括一些第H语言中允许的结构，如 IP外带宾格的 NP。

This problem is always NP-C problem, so the approximate method is usually to be found.

由于这类问题往往都是NP完全问题，人们通常寻求其近似算法。

The problem is NP-hard, so we want to find approximate algorithms to solve the problem.

由于这个问题是NP-hard的，因而我们转为寻找问题的近似算法。

Secondly, The optimal CDMA receiver in AWGN channel is a NP complexity problem in synchronous and asynchronous transmission.

其次，在同步和异步传输中最佳多用户检测都是一个具有NP复杂度的组合优化问题。

Tao's findings are based on a painstaking series for experiments that reealed the atomic structure of NP.

Jane Tao的发现是建立在一系列辛苦实验基础上，显示了NP的原子结构。

Cross Entropy method has recently been proposed as a heuristic method.It shows some simple performance in the process of solving combinatorial optimization problems.This paper makes full use of Cross Entropy method to obtain the best estimator for the max-cut problem which is a standard NP-hard problem in graph graphic theory.

交叉熵方法是近几年发展而来的一种启发式方法，在求解组合优化问题中显示出其简单有效的特点，将运用交叉熵方法寻求图论中一个典型的NP困难问题—最大割问题的最优解。

Corresponding to such a NP-hard problem, this paper gives some polynomial time solvable cases, and a branch and bound algorithm with a rapid method for estimating the lower bound for general case.

对这一NP-困难的排序问题，文中给出了几个多项式可解的特殊情形，一般情况下的一个快速下界估计方法以及相应的分支定界算法。

The topics are divided into three parts: the first part introduced the basic concepts of algorithms, mathematical algorithms and algorithms based on complexity analysis scheduling problem for the second part of the problem and plans to discuss a variety of existing algorithms, and describes the design of commonly used algorithms including sub-rule law, greedy method, dynamic programming, backtracking and branch and bound method, and describes the complexity of the calculation, as well as NP-complete problem the third part of the model on parallel computing and parallel algorithm design techniques.

全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。

Chlorination for the majority of applications, the best choice of EPDM seal NP pump head.

对于大多数加氯的应用，最好选用EPDM密封的NP泵头。

Circle packing problem, one of the NP hard problems, is of great theoretical and practical value.

求解具有NP难度的圆形packing问题具有很高的理论与实用价值。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。