NP
美 
英
- abbr.(=neptunium)【化】镎
- 网络壬基酚(Nonylphenol)；网络处理器(Network Processor)；核蛋白(nucleoprotein)
英汉解释
abbr. | 2. 【商】(=no protest)未拒付(票据等) |
英英解释
例句
Computing the crossing number of a given graph is NP-complete the crossing number of only a few families of graphs are known.
计算图的交叉数问题被证明是NP-完全问题，能确定具体交叉数的图类也比较少。
As an NP complete problem, grid workflow scheduling is usually solved by means of heuristics.
作为一个NP完全问题，通常采用启发式算法来解决网格工作流调度。
Some bin packing problems are NP-complete but are amenable to dynamic programming solutions or to approximately optimal heuristic solutions.
某些装箱问题是NP完全的，但可以通过动态规划法或近似最优的启发式解法来解决。
She was discouraged, however, to find that the NP-DNA did not decrease protein production as expected.
然而，她发现NP—DNA不能像期盼中的那样减少蛋白质产生量，感到很失望。
Verify via observation and inquiry that the injection-molding machine used for Mattel production is dedicated for the use with NP PVC.
确认通过观察和调查的注塑机生产中使用的是美泰专门为与国民党聚氯乙烯的使用。
AIM To see if negative priming (NP) occurs in high frequency (grade 1) Chinese characters, and to design a model on which this may happen.
目的探讨高频汉字（1级）能否发生负启动效应，并初步建立高频汉字负启动效应发生模型。
NP is common in the water, having good chemical stability, and easy to accumulate in the organisms.
NP是一种常见的、化学性质稳定的，并且容易在生物体内积累的污染物。
NP problems are much tougher to solve but relatively easy to check once you've reached an answer.
而NP问题，则是困难处理的，但得到答案后，相对前者容易验算。
Np No Project. Supresses loading of any desktop files on IDE startup and suppresses creation of a default project.
不载入工程。在IDE启动时禁止载入任何桌面配置文件也不加载默认工程。
The utility model relates to a tool used in The utility model relates to #np 1 daily life, in which money and various tickets are put.
本实用新型涉及一种日常生活用的装钱币及各种票据工具。
In the half a century since the problem was recognized, no one has found an efficient algorithm for an NP-complete problem.
NP完备问题被确认至今已有半个世纪之久，到目前为止还没有人找到它的有效演算法。
The stickiness of the NP-DNA might enhance the speed and accuracy of such a drug-delivery system.
NP—DNA的粘性可以增加这种药物运送系统的速度和准确性。
It is proved that this problem belongs to NP complete problem, and it needs to be solved by random method.
首先证明了该问题属于NP完备问题，因此必须使用随机算法代替穷举来求解。
And that now must be the frictional force, because NP is still the frictional force.
这肯定是摩擦力，因为NP还是摩擦力。
As it knows to all, the degree-constrained minimum spanning tree problem is a NP difficulty in the network design and optimization.
度约束最小生成树问题是网络设计和优化中的一个NP难题。
Since the majority of scheduling problems, particularly the practical ones, are NP-hard, approximation algorithms are needful to solve them.
由于大部分排序问题，特别是有实际价值的问题是NP困难的，因此在实践中往往需要使用近似算法。
Decision tree is an important tool for data mining. However, the design of optimal decision tree is proved to be a NPcomplete problem.
决策树是一种重要的数据挖掘工具，但构造最优决策树是一个NP-完全问题。
There's no reason for you to clutter up your code with variable types beginning with LP and NP .
对你来说没有任何理由因为以LP和NP开始的变量类型而导致代码混乱。
Task assignment problem is a typical NP problem. Particle Swarm Optimization (PSO) algorithm was used to solve task assignment problem.
任务指派问题是典型NP难题，引入粒子群优化算法对其进行求解。
Once the PMC got convinced that putting a solver tackling NP-completeness in eclipse was the right way to go, we were set.
一旦PMC确信放置一个求解程序来处理eclipse的NP完整性问题是正确的方向，我们就开始动手了。
In a separate news conference , Senate majority leader HR joined House Speaker NP in urging the president to reconsider .
在一两党各自的新闻发布会上，参议院多数党领导人HR同众议院发言人NP一起均力劝总统重新考虑该方案。
They have discovered that the task falls into a notorious category of problems called NP-complete.
因为他们发现这个问题正是以耗时而闻名的NP完备（NP-complete）问题。
The results indicate that the proposed algorithm can quickly obtain the satisfactory solutions of this type of NP-complete problems.
实验结果表明，该算法能在较短时间内给出这类NP完备问题的满意解。
As a classical Combinatorial optimization problem, resource-constrained project scheduling problem belongs to NP-Hard puzzle in theory.
资源受限项目调度问题作为一类典型的组合优化问题，理论上属于NP难题。
But despite a widespread misconception to the contrary, the factoring problem is neither known nor believed to be NP-complete.
不过，和普遍的错误认知相反，专家并不知道也不相信因数分解是NP完备问题。
To the best of our current knowledge, there are no exact solutions to problems that are NP Complete.
按照目前的知识，NP完全问题没有精确解。
NP and VP are essential components of a sentence, comprising the subject and predicate.
名词词组和动词词组是句子中最重要的词组，因为它们构成了句子的主语和谓语。
This study design primer rely on the NP fragment which is one of the conservative fragment of AIV to confirmate the existence of the AIV.
本研究根据AIV保守片段NP片段进行引物设计，以确定A型流感病毒的存在。
It have been proved that RWA (routing and wavelength assignment) algorithm in arbitrary mesh optical networks is a NP-complete problem.
光网络中的路由和波长分配（RWA）算法是NP难问题。
In the case of uncovering corrupt clan activity, the removal of NP is more common and, in more extreme cases, the clan may be disbanded.
在揭露腐败宗族活动的情况下，国民党清除较为常见，在更极端的情况下，可能会解散家族。
The path packing problem is an optimization problem with many important applications. However, it is NP-hard in computational complexity.
图的路包装问题是一类有着重要应用背景的最优化问题，然而它在计算复杂度上是NP-困难的。
In this paper, we prove this problem to be a difficult problem that is NP complete through a polynomial reduction.
本文给出了多项式时间规约证明了在一般图上该问题是一个困难问题，即是NP完全的。
Nonlinear bilevel programming lacks efficient algorithms due to its computational difficulties such as non convexity and NP -hardness.
由于非线性两层规划具有非凸性、NP-难等计算困难，高效的算法并不多见。
In this paper, hairpin structure and molecular beacons are applied in solving a few NP complete problems.
本文主要给出发夹结构及分子信标在几个NP完全问题中的应用。
The authors reviewed the main progress of the NP tissue engineering from cells, scaffolds, growth factor.
作者就种子细胞、细胞支架和生长因子方面髓核组织工程学的研究进展进行综述。
However, almost all routing questions are proved to be NP difficult questions and there are no perfect routing algorithms.
然而几乎所有的布线问题都被证明是NP完备问题，目前还没有一个十全十美的布线算法。
Others are looking for a proven information system of the best reduction is a NP -problem.
现已证明寻找一个信息系统的最优约简是NP-难题。
The optimal layout problem of circle group in a circular container with performance constraints of equilibrium belong to NP-hard problem.
带平衡性约束的圆集在圆容器内的布局优化问题，属于NP困难问题。
NP The called party is not, or is no longer a subscriber.
被叫者不是或已经不再是用户电报的用户。
By utilizing equivalent problem and linear relaxation technique, the proposed algorithm is convergent to the global minimum of (NP).
通过利用等价问题和线性化技巧提出的算法收敛到问题（NP）的全局极小。
