np-complete中文是什么意思

发音:

中文翻译
造句

np完备
np完全

np Np ＝【化学】neptunium 镎。
complete adj. 1.完全的；圆满的，全面的，全能的。 2.完成 ...
amboseli np 安博塞利国家公园
co-np 反np
empilan np 聚氧乙烯壬苯基醚
feng np 冯年平
fiordland np 峡湾国家公园
hot-np neurophysin]人催产素相关后叶激素运载蛋白; 人催产素相关后叶激素运载蛋白
kahurangi np 卡胡朗吉国家公园
kibale np 基巴莱国家公园
lukla np 卢克拉
nakuru np 纳库鲁湖国家公园
nonylphenol np 壬基酚
np nepal 尼泊尔
np (complexity) np (度)
np (度) np (complexity)
np completeness np完全性
np deficiency np缺乏
np-9 壬基苯酚聚乙二醇醚
np-avp vasopressin]血管加压素相关的后叶激素运载蛋白; 血管加压素相关的后叶激素运载蛋白
np-hard 困难性
np缺乏 np deficiency
np完备 np-complete
np完全 np-complete

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

Although most of domination numbers have good applying background , the decision problems corresponding to those are np - complete or np - hard . thus it is interesting to investigate the bounds of those . it is useful to design their algorithm
虽然许多类的控制数有很好的应用背景，但其相应的判定问题是np完全问题或np困难问题。因而，对于控制数的上下界的精确估计是人们感兴趣的一个问题，它对于设计相应的近似算法具有实际意义。
The rectilinear steiner minimal tree rsmt problem is one of the fundamental problems in physical design , especially in routing , which is known to be np - complete . this paper presents an algorithm , called aco - steiner , for rsmt construction based on ant colony optimization
制造工艺由超深亚微米vdsm进入到纳米nanometer阶段，作为物理设计physical design重要阶段之一的布线routing ，其算法研究与工具设计面临新的挑战。
Efficient task scheduling is essential issue in heterogeneous < < computationally intensive > > grid environment . the problem has been proved to be np - complete . a heuristic algorithm called htscc based on communication and computing cost has been presented . the algorithm considers different computing power , size of task and network bandwidth . compared with the related work , the result shows that performance of the algorithm htscc significantly surpasses the previous approaches in heterogeneous environment
在计算密集型的异构网格环境中,有效的任务调度是一个关键的问题,这是一个完全np问题,针对这一问题提出了一种基于通信和计算开销的启发式网格任务调度算法,这一算法考虑了不同的节点计算能力、任务大小和网络带宽,最后给出了相应的实验及相关算法的比较结果,表明了该算法对于异构环境具有更优的性能。
Considering the np - complete problem , how to get the approximate optimized scheme of job - shop scheduling , and aimed at improving the efficiency of products and taking good advantage of concurrence , asynchronism , distributing and juxtaposition in multi - products and devices processing , we could divide the working procedures into the attached one which has the only precursor and subsequence and unattached one by analyzing working flow chart of job - shop , that is the working procedures are divided into two types , then the bf and the ff methods about memory scheduling in os are applied , therefore a new approximate optimized scheme is presented in the paper which could solve the common job - shop scheduling . namely , the acpm and the bfsm are applied to the classified and grouped working procedures considering the compact of the procedures and practical examples approved it . the results we analyzing and tested show that it is better than the heuristic algorithm common used , for less restriction terms , more satisfying algorithm complexity and better optimized results
针对job - shop调度问题求最优解算法这一npc问题，本文以充分发挥多产品、多设备加工所具有并发性、异步性、分布性和并行性的加工优势，从而提高产品的加工效率为目标，对job - shop调度问题的工艺图进行适当分解，使工序在一定时间段或是为具有唯一紧前、紧后相关工序或是为独立工序，即将工序分两类，再结合操作系统中内存调度的最佳适应( bf )调度方法和首次适应( ff )调度方法的先进思想，通过分析提出了一种解决一般job - shop调度问题的全新近优解方案：在考虑关键设备上工序尽量紧凑的前提下，将工序分类、对这两类工序分批采用拟关键路径法( acpm )和最佳适应调度方法( bfsm )安排工序的算法，用实例加以验证，并给出结果甘特图。
As far as the vlsi physical design is concerned , many problems have been proved to be np - complete , such as placement , global routing and detailed routing . on the other hand , the computational intelligence , a novel approach of optimization techniques have showing its great capacity and potential in solving large - scale complex problems , hence the study of computational intelligence methods to solve existing problems is very necessary for high performance physical design in the deep sub - micron technology
Vlsi物理设计中的布局、总体布线和详细布线是典型的np问题，计算智能方法为解决np复杂度的大规模问题展示了广阔前景，因此研究各种计算智能算法求解这类问题，对于满足深亚微米工艺下高性能物理设计中的诸多要求是十分重要的。
This paper firstly introduces the present develovment of dna computing , the mathematic theories of dna computing , the biological base of dna computing and the mechanism of dna computing . secondly , the paper analyzes the living example model of dna computing in sloving np - complete problem . on the foundation of the former encoding methods , the paper poses two new encoding methods : one based on weight is represented by dna string , the other based on melting temperature control encoding method , and the practical use of two encoding methods in sloving tsp problem
本文首先介绍了dna计算的发展现状、 dna计算的数学理论、生物学基础及dna计算的机理;分析讨论了dna计算在解决np -完全问题上的应用实例模型;在总结以往编码的基础上,提出了基于dna序列表示权值大小的编码方法和基于熔点温度控制编码方法,并应用两种编码方法来解决旅行售货员问题( tsp问题) ;最后给出了基于粘贴系统模型的tsp问题的dna分子算法和应用实例。
The duty of real - time system is to provide time constraint guarantees for the real - time applications , in other words , it make the applications access to the resources they need timely . many works have devoted into individual resource scheduling ( i . e . processor capability , disk bandwidth and network bandwidth ) . obtaining simultaneous and timely access to multiple resource is known to be a np - complete problem
大量的研究工作集中在单纯的网络带宽、磁盘带宽和处理器资源各自的调度优化上，而在同一个节点上同时使用多个资源的是比较复杂np完全问题，本文分析了一种在资源预留系统( resourcekernel )中解决该问题的途径，联合调度服务器( css ) ，并对其中的关键问题? ?伸缩量分配( slacksharing )作出了改进，提出了一种基于当前系统负荷的分配算法。
The book embedding problem is interesting , because it arises from several areas of computer science , vlsi theory , multilayer printed circuit boards ( pcb ) , sorting with parallel stacks and turning - machine graph , etc . the problem is very difficult : it is np - complete to decide whether a planar graph can be embedded in two pages , and even for a given labeling / , determining the pagenumber pn ( g , f ) is also np - complete
图的书式嵌入起源于许多领域，包括：计算机科学，大型集成电路（ vlsi ）理论，多层线路板印刷（ pc旧s ），平行机排序及timing机图等等。该问题的难度相当大，即使对平面图而言判定其可否2页嵌人也是ni3完全的，并且甚至在给定顶点顺序的前提下，确定图的书页数也是np完全的。
Two - dimensional packing problem arises from a variety of situations including apparel industry , parts nesting problems and super large - scale integration ( slsi ) . packing belongs to np - complete ( nondeterministic polynomial time complete ) problem , which is too difficult to be expressed accurately in simple information model . in addition , the part that can be expressed in mathematical model belongs to np - complete problem
布局问题来源于现代生产的许多领域并且表现为多种形式，如服装行业，部件拼装和超大规模集成电路( slsi ) ，但是由于布局问题具有高度的复杂性，属于组合优化问题和np完全问题，它很难用单一的知识模型(如数学模型)来精确表达，另外，可用数学模型表达的部分具有np完全计算复杂度。
Standard shortest path algorithms ( such as the dijkstra algorithm ) are not valid , since travel times are random , time - dependent variables . especially , the recognition version of the stochastic shortest path problems is np - complete . k expected shortest paths problem shown in this paper is one of these problems
传统的最短路径方法不能解决这种非线性路径耗费的路径问题，尤其是同时具有随机性和时间依赖性的网络使得最优路径问题成为np完全问题，本文研究的k期望最短路径就是这样的问题之一。

更多例句： 1 2 3

百科解释

In computational complexity theory, the complexity class NP-complete (abbreviated NP-C or NPC) is a class of decision problems. A decision problem L is NP-complete if it is in the set of NP problems and also in the set of NP-hard problems.

详细百科解释