NP-难解,NP-hard英语短句,例句大全

NP-难解,NP-hard
1)NP-hardNP-难解
1.The black and white salesman problem(BWTSP) is a new NP-hard problem,which can be divided into the undirected BWTSP and the directed BWTSP according to the symmetry of edges in graph.黑白旅行商问题(BWTSP)是近年来出现的新NP-难解问题,根据图中边是否对称可以分为无向BWTSP和有向BWTSP两种。
2.QAP belong to the NP-Hard problems, which can t be solved in polynomial time.QAP问题通常在多项式时间内无法求解，属于NP-难解问题。
3.This new fat-based heuristic shows a new way for other NP-hard problems.旅行商问题(traveling salesman problem,简称TSP)是经典的NP-难解组合优化问题之一,求解它的高效启发式算法一直是计算机科学研究的热点。
2)NP-hard problemsNP-难解问题
3)NP-hardNP难
1., absolutely dominated model which is non-linear binary integer program and NP-hard.提出了绝对优势模型,这个规划是非线性的0 1规划且是NP难的。
2.It is shown that this problem is NP-hard.更新网络监测体系包括新增和重新配置收集节点两方面的代价,求解总代价最小的更新方案的问题是NP难的。
3.Firstly, P| ptmn (δi)| Cmax is proved to be an NP-hard optimization problem.首先证明了这个问题是一个NP难优化问题。

英文短句/例句

1.Some Efficient Algorithms for NP-hard Program;求解NP难度问题的几种有效的快速算法
2.On "NP+de(的)+VP" Structure and Some Relevant Issues;“NP+的+VP”结构和相关难题的破解
3.Approximation Algorithms for Some NP-Hard Combinatorial Optimization Problems;若干NP-困难的组合最优化问题的近似算法
4.The Condition and the Degree of NP Ellipsis in Narrative Text;叙事语篇中NP省略的语篇条件与难度级差
5."Xiang+NP+VP"and"VP+Xiang+NP";“向+NP+VP”和“VP+向+NP”
6.The optimum allocation of process flowchart in a distributed system is an NP-complete problem.进程流程图在分布式环境下的最优分配是一np难度问题。
7.A Pragmatic Approach to "the V+NP+NP" Structure;“V+NP+NP”结构的语用分析
8.On NP s Dividing Backward Movement of "NP+V_1";“NP+V_1”中NP分裂后移初探
9.A Pragmatic Study of "NP+我" and "我+NP";“NP+我”与“我+NP”的语用考察
10."There be +NP +PP" and"NP1 有NP2";“There be+NP+PP”和“NP1有NP2”
11.Further Discussion on "Ns+V+得+NP+VP";也谈“Ns+V+得+NP+VP”
12.Self-reference and Transferred-reference: The Contrast Between "VP+de(+NP)" and "VP+ の/NP ";“VP+的(+NP)”与“VP+‘の/NP’”自指转指的对比
13.The Multi-dimensional Restriction of "NP ne? A" on NP;“NP呢?A”句式对NP的多维制约
14.On the Case of the Nominal Phrases in the NP-be-NP Copular ConstructionNP-be-NP型英语系动词句格位问题探讨
15.Comparing "No+NP" and "Very+NP" in Modern Chinese现代汉语“不+NP”与“很+NP”之比较
16.On the Prominence and Metaphor of "Man(满)+NP" and "Quan(全)+NP"“满+NP”与“全+NP”的突显差异及其隐喻模式
17.Noun phrase is abbreviated as NP.名词片语缩写成 np.。
18.A Study about the Structure of "(NP) (T) Zài VP";“（NP）（T）再VP”结构研究

相关短句/例句

NP-hard problemsNP-难解问题
3)NP-hardNP难
1., absolutely dominated model which is non-linear binary integer program and NP-hard.提出了绝对优势模型,这个规划是非线性的0 1规划且是NP难的。
2.It is shown that this problem is NP-hard.更新网络监测体系包括新增和重新配置收集节点两方面的代价,求解总代价最小的更新方案的问题是NP难的。
3.Firstly, P| ptmn (δi)| Cmax is proved to be an NP-hard optimization problem.首先证明了这个问题是一个NP难优化问题。
4)NP-hardNP-难
1.We give two characters of it s optimal (solution) and prove that the problem is NP-Hard.讨论一类工件的加工时间受资源约束的单机排序问题1pj=bj-ajuj,∑uj≤U∑wjCj,给出它的最优解的两个性质,证明该类问题是NP-难的。
2.Furthermore,we prove that this problem is NP-hard in the ordinary sense.提出该问题的伪多项式时间算法,进一步给出一般意义NP-难的证明。
5)NP hardNP难
1.It proves that the optimal transmission ranges for all areas is a multi-objective optimization problem(MOP),which is NP hard.证明搜索各区域最优的传输距离是一个多目标优化问题,即是NP难问题。
2.Further analysis appears that the time complexity of function f:Nn→N is O(cn),c∈N,the computing to f:Nn→N is an NP hard problem.对函数f∶Nn→N的计算属NP难问题。
6)NP hard problemNP难
1.TSP is a typical combination optimization problem,which is also a NP hard problem.TSP是一个典型的组合优化问题,并且是一个NP难题,其可能的路径总数与城市数目n是成指数型增长的,所以一般很难精确地求出其最优解,因而寻找出有效的近似求解算法就具有重要的意义。