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）的全局極小。
