np-hard 中文意思是什麼

np-hard 解釋
困難性
  • np : 1. no protest 【商業】未拒付（票據等）。2. ＝noun phrase 名詞短語。Np ＝【化學】neptunium 鎿。
  • hard : adj 1 硬的，堅固的 （opp soft）。2 （身體）結實的；（組織等）健全的。3 （問題、工作等）困難的，費...
  1. In concurrent engineering ( ce ), digital product pre - assembly planning is one of the np - hard problems and becomes a research focus in industrial automation area

    在并行工程中，數字化產品序列預裝配規劃問題屬于np難題，是自動化領域研究的熱點問題之一。
  2. Vsp is a typical strong np - hard problem, high effective exact algorithm is immposible to it. heuristic algorithm can resolve large - scale problem, but cannot ensure the quality of the resolution

    Vsp是一個典型的np -難題，高效的精確演算法存在的可能性不大，啟發式演算法雖能快速求解大型問題，但對解的質量沒有保證。
  3. It has been proven in theory that the jssp is a classical np - hard

    在理論上已經證明， jssp是一個np難題。
  4. Meanwhile, the promising aspects of ga and mas for solving np - hard problems are highlighted. the second chapter analyses in detail how to adapt ga for jssp, and compares the performances of the ga in binary coding and decimal coding

    接著本文詳細探討了將ga運用在車間調度問題（ jobshopschedulingproblem ， jssp ）中的關鍵技術，同時對比了二十進制編碼方案的性能。
  5. Job shop scheduling is not only a representative problem of np - hard, but also a very active and popular subject researched by many scholars, which has been paid close attention to by both academia and industry

    車間作業調度問題是一個典型的np - hard問題，也是一個前沿性的研究課題，已受到學術界和工業界的廣泛關注。它的研究不僅具有重大的現實意義，而且具有深遠的理論意義。
  6. Based on tabu search, a local search technique with changeable local structure ( algorithm 2 ) is proposed for this np - hard problem, which provides an approach to control the optimizing process flexibly

    基於tabu搜索設計了變鄰域結構的局部搜索技術，提供了靈活控制尋優過程的途徑;全多項式時間復雜性近似策略的開發，使得0一1背包問題的求解成為了n戶c問題近似演算法設計中最為成功的範例。
  7. Second, we tackle a np - hard problem of scheduling jobs on a bank of parallel machines with the objective of minimizing the makespan, under the constraints of non - preemption and no precedence relationship. the worst - case analysis of fpsf ( fast processing speed first ) heuristic is discussed

    2 ）研究并行加工系統對通過時間（ makespan ）的優化問題（ pm | | cmax問題） ，提出了新的演算法，並對最壞情形作出了分析。
  8. This dissertation discusses the mtbf and mttr ' s calculation of all - pair and terminal - pair can be obtained using relevant formula, but obtaining the coefficients is np - hard, sothose analyses are limited in small metworks

    本文還分別就一般可修復網路全端問題、兩端問題的mtbf和mttr的計算進行了討論，得出了各自的計算公式。
  9. Since ic came forth, its evolution have almost accorded with the rule of moore. now the technology of ic had broken through the barrier of wire width at 100nm. with the condition of this, more and more problems of physical design of vlsi circuits change into np - hard problem

    自從ic誕生以來， ic晶元的發展基本上遵循了摩爾定律，目前已經突破100nm大關，相應的系統規模的擴大，使得ic物理設計中的很多困難日益np問題日益棘手。
  10. Not only that but also the capacity of physical design of vlsi circuits itself do not catch up with the development of the technology of vlsi. for vlsi circuits, on the one hand many np - hard problems are impossible or very difficult to be solved by using traditional optimum algorithms ; on the other hand is that many new and specific deep sub - micron technology problems had not been considered, which will influence chip ' s performance

    此外ic本身的物理設計能力一直落後同時代的製造工藝能力，於是就造成了下面的這種局面：現有eda工具難以應付復雜度呈指數增長的諸多vlsi物理設計難題，也缺乏對深亞微米工藝下一系列新問題（如：功率危機、復雜度危機和互連線危機）的考慮。
  11. Owing to the strong condition of equivalence relation, there exist some limits, and it has been proved to be np - hard to find all reductions and a minimal reduction

    由於等價關系條件較強，有一定的局限性，已經證明求所有約簡和最小約簡是np - hard問題。
  12. Because the watermark embedding and the noisy channel were directly related to the codeword index order in the model, at the same time deciding the codeword index was a np - hard problem typically, so the ant colony algorithm was introduced to optimize it in order to make the bit error rate lower and the embedded watermark more invisible

    在該模型中，由於水印嵌入和通道噪聲直接與碼字索引相關，所以該模型誤差由索引值決定，又由於碼字索引的確定是np難度問題，故引入蟻群演算法對其優化是方便的，優化目標是降低誤碼率和使不可見性達到最佳。
  13. In chapter 2 we study two parallel machines scheduling to maximize non - delay jobs. the problem is np - hard for it contains a sub problem equivalent to partition problem

    第二章討論兩臺平行機排序極大化按期完工工件數問題，由於它的一個子問題等價于劃分問題，因而該問題是一個np -難的問題。
  14. Because the most scheduling problem is np hard, it is impossible to find out common algorithm with polynomial complexity

    由於調度問題大多數都是具有np難度的組合優化問題，尋找具有多項式復雜性的優化方法幾乎是不可能的。
  15. We used heuristics branch and bound algorithm in this study since scheduling of parallel machines is a np - hard problem and we proposed four heuristics optimal scheduling algorithms in this study

    根據johnson演算法和并行可替換機床優化調度演算法，構造了兩種可行的啟發式優化調度演算法，並通過數值計算，驗證了演算法的有效性。
  16. Many problems of engineering and system are integer or mixed integer programming problems. lt is well known that the problem of integer programming is a np - hard problem, and the method for it is exponential complex

    工程、系統問題中有許多問題屬于整數或混合整數規劃問題。眾所周知，線性整數規劃問題是np - hard問題，求解該問題的精確解演算法具有指數復雜性。
  17. Because it can " t finish in polynomial time, the scheduling problem is known to be np - hard

    由於該問題不能在多項式時間內求得最優解，因而被公認為一個np完全問題。
  18. Because building optimal fuzzy decision tree is np - hard, it is necessary to study the heuristics

    由於構建最優的模糊決策樹是np - hard ，因此，針對啟發式演算法的研究是非常必要的。
  19. The genetic algorithm ( ga ) is a new parallel optimize algorithm, which can be used to solve many kinds of np - hard problems

    遺傳演算法是一種用於解決優化問題的并行尋優演算法，已被廣泛用於解決各類np問題。
  20. In real shopfloor scheduling scenarios, resource restriction coexists with process restriction, which makes shopfloor scheduling problems np - hard

    但是，資源約束和工藝約束的並存，使得車間調度成為一類np - hard問題。
分享友人
分享到 Line

分享到臉書