Noun phrase is abbreviated as NP.
名詞片語縮寫成NP. .
辭典例句
Syntactic stuctures mainly include NP + Aux . V + VP , NP + Neg + Aux. V + VP and NP + Aux.
助動(dòng)詞的句法結(jié)構(gòu)主要有NP+助動(dòng)詞+VP 、 NP+Neg+助動(dòng)詞+VP、NP+助動(dòng)詞等幾種,每一格式的內(nèi)部有一些變化.
互聯(lián)網(wǎng)
The graph coloring problem is a well - known NP - complete problem.
圖著色問題是著名的NP - 完全問題.
互聯(lián)網(wǎng)
Traveling salesman problem ( TSP ) a typical NP complete combinatorial optimum problem.
旅行商問題 ( TSP ) 是典型的NP完全組合優(yōu)化問題.
互聯(lián)網(wǎng)
Conclusion: AmB - PBCA - NP modified by polysorbate 80 can pass the blood - brain barrier.
結(jié)論: 聚山梨酯-80修飾的 AmB -PBCA-NP具有主動(dòng)腦靶向作用.
互聯(lián)網(wǎng)
Traveling salesman problem ( TSP ) is a typical NP complete combinatorial optimum problem.
摘要旅行商問題 ( TSP ) 是典型的NP完全組合優(yōu)化問題.
互聯(lián)網(wǎng)
Objective To explore hyperglycemia reaction induced by chemotherapy with NP regimen.
目的探討“NP”方案化療引起高血糖反應(yīng)的情況.
互聯(lián)網(wǎng)
The travelling salesman problem was used to illustrate NP - hard problems.
旅行商問題的是用來說明NP難問題.
互聯(lián)網(wǎng)
Time - table problem a NP - complete problem.
排課表問題是NP - 完全問題.
互聯(lián)網(wǎng)
Due to its non - linear and NP hard, classical optimizing approaches can not solve it.
由于其所具有的非線性、NP難 等復(fù)雜特性, 常規(guī)方法難以求解.
互聯(lián)網(wǎng)
The model is in fact a special type of classic location - allocation models and has NP - hard complexity.
該模型是一種特殊形式的選擇 —分 配模型,具有NP難性質(zhì).
互聯(lián)網(wǎng)
For general graph, a NP - hard question to get the bondage number or reinforcement number.
對一般的圖, 求其綁定數(shù)和增強(qiáng)數(shù)是NP - 困難問題,在本文中我們求出了兩類圖的綁定數(shù)和增強(qiáng)數(shù).
互聯(lián)網(wǎng)
The optimum allocation of process flowchart in a distributed system is an NP - complete problem.
進(jìn)程流程圖在分布式環(huán)境下的最優(yōu)分配是一np難度問題.
互聯(lián)網(wǎng)
Objectives . To identify roles of notochordal NP in extracellular matrix ( ECM ) metabolism of IVD.
目標(biāo):研究IVD代謝過程中細(xì)胞外基質(zhì) ( ECM ) 的脊索NP所扮演的角色.
互聯(lián)網(wǎng)
It is a NP difficult problem to generate complete decision rules based on rough set theory.
摘要針對基于粗糙集理論提取完全的決策規(guī)則是NP難 問題,提出一種獲取統(tǒng)計(jì)意義下的完全的簡化規(guī)則的算法.
互聯(lián)網(wǎng)