np-complete 中文意思是什麼
np-complete
解釋
np完備-
Time - table problem is a np - complete problem
排課表問題是np -完全問題。 -
This is analogous to the np complete problem
這與np完全問題是類似的。 -
Unfortunately, the problem of finding multicast routing with qos constrained is a np - complete problem. so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra
然而研究表明，由於qos組播路由帶有多個qos約束參數，因此qos組播路由問題是一個np完全問題，這使得它與傳統的路由過程不同，難以用經典的最短路徑優先演算法求解。 -
Constructing an evolutionary tree is a typical np - complete problem, therefore it is of great significance to construct an algorithm capable of getting optimal approximate solutions
發生樹的構建問題是一個np完全問題，因此，研究構造發生樹的近似最優演算法有著重要意義。 -
And of all scheduling problems, the job - shop scheduling problem ( jsp ) is most common and complicate, which is usually a typical np - complete problem
本文主要介紹了約束滿足神經網路（ csnn ）在作業車間調度問題（ jsp ）中的應用。 -
The schedule of this kind of production can be formulated as assigning n parts to m machines. to find the optimal solution is an np - complete problem in theory
該類生產的調度可歸結為n種零件需經m類機器加工的復雜非流水型作業系統的排序問題。 -
A approximate algorithm is presented by which satisfactory results of two dimensional optimal layout belonged to np complete problems can be obtained efficiently and rapidly
摘要針對理論上屬于np完全問題的二維矩形件優化排樣問題，構建了一個排樣效率高、計算速度快和排樣效果好的一種近似演算法。 -
( 3 ) it is well known that the determinant problem in classic proposition logic is a np complete problem, and the first order logic is a half determinant one. so both the analysis of computing complexity and the realization of it are the most important fields
（ 3 ）眾所周知，經典命題邏輯中的判定問題是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 ，其演算法研究與工具設計面臨新的挑戰。 -
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 ）安排工序的演算法，用實例加以驗證，並給出結果甘特圖。 -
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期望最短路徑就是這樣的問題之一。 -
This problem refers to constructing minimum - cost spanning trees constrained by delay, which is known to be np - complete
該問題的目標是創建一棵覆蓋源節點和目的節點的代價最小樹，且滿足端到端時延要求。 -
Three - dimensional component packing is a combinatorial optimization and np - complete problem. it is difficult to find its exact global optimum
三維布局問題屬于組合最優化問題和np完全問題，在一定時間內求其精確全局最優解是相當困難的。 -
Scheduling problems are known to be in general np - complete, only sub - optimal can be obtained by classical scheduling approaches in most cases
任務分配與調度問題是一類np問題，經典調度理論一般僅能獲得問題的近似最優解。 -
Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
布局問題是具有np完備計算復雜度的離散組合優化問題。 -
The vrp can be regarded as an extension of the tsp and it is np - complete
車輛路徑問題可以看作是旅行售貨員問題的推廣，它是np -完備的問題。 -
The crossing number of graph, which is an np - complete problem, has an important theory meaning
圖的交叉數問題屬于np -困難問題，對它的研究有重要的理論意義。 -
With the rapid progress in deep sub - micron technology, most of the routing problems raised in physical design of vlsi chips, whatever they are not - np hard, np complete or np difficult, are demanding more efficient routing algorithms
在目前ic的工藝條件下，很多vlsi的物理設計中的布線問題（無論是非np問題、 np完全問題和np困難問題） ，由於問題規模的急劇增大，都迫切需要更有效的優化方法來解決。 -
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復雜度的大規模問題展示了廣闊前景，因此研究各種計算智能演算法求解這類問題，對于滿足深亞微米工藝下高性能物理設計中的諸多要求是十分重要的。 -
A polynomial function of 3 - sat to area minimization was given in a pubilshed thesis, this could prove the area minimization is a np - complete problem. but this must be discussed in there cases : k 5, k = 4, and k = 3
原有的證明是利用3 - sat問題規約到面積優化問題，但是要分別對k 5 、 k = 4和k = 3的情況分別討論，證明過程比較復雜。
分享友人