polynomial time 中文意思是什麼

polynomial time 解釋
多項式時間
  • polynomial : adj. 1. 【動、植】多詞學名的。2. 【數學】多項式的。n. 1. 【動、植】多詞學名。 2. 【數學】多項式。
  • time : n 1 時，時間，時日，歲月。2 時候，時刻；期間；時節，季節；〈常pl 〉時期，年代，時代； 〈the time ...
  1. The experiments show that the performance of our method is similar to the ye - 0. 699 algorithm, which is the best approximate algorithm in polynomial time. but our method can effectively solve the max - bisection problem with a large scale. 2

    數值實驗表明，該方法與ye - 0 . 699近似演算法（現有的求解圖的最大二等分問題的最好的多項式時間近似演算法）得到的解的性能幾乎沒有差異
  2. The main idea of this method is to choose a set according to the order of polynomials, to eliminate by making use of bezout eliminant, get zero set from the improved formula about set of zero points, so that a polynomial system of equation ~ set of zero points can be got only by one time arrangement

    該方法的主要思想是：根據多項式秩的大小選取基組，採用貝左結式消元，用改進型零點集結構式確定零點集，從而只需一次整序就可求得一個多項式方程組的零點集。
  3. A polynomial time algorithm in positive define geometric programming with constraints

    約束正定式幾何規劃的一種多項式時間演算法
  4. Without the strict feasibility of the initial points and iteration points, the algorithm is shown to possess both polynomial - time complexity and q - linear convergence

    該演算法不要求初始點及迭代點的可行性且具有q -線性收斂速度和多項式時間復雜性。
  5. As the determination of such optimal multicast routes was computationally intractable in polynomial time, a multicast routing algorithm based on genetic algorithm was proposed to simultaneously optimize different parameter, in which multiple multicast tree route solutions were generated

    由於多播路由的最優選擇問題在多項式時間內難以求解，提出一種使用遺傳演算法的路由演算法來同時優化不同的服務質量指標，計算產生出幾種路由樹。
  6. Polynomial - time approximation schemes ( ptas ) : a ptas is a family of algorithm { a | > 0 } such that for any fixed > 0, a runs in time polynomial in the length of the input and gets a solution with an objective value which is at most 1 + e times of the optimum

    若每次修正後，實例的目標函數值不超過原來的1 + o （ ）倍，我們稱修正費用不超過1 + o （ ） 。 ptas演算法：若演算法列{ a _ }對于問題的任一個例子都是1 +近似演算法，計算次數是問題大小的多項式（將視為常數） ，稱它為ptas演算法。
  7. In this paper, first, i present a new model of vrp and a heuristic algorithm of it. then, i have proofed that on the distance constrained vrp, any polynomial time heuristic h for mv, we have kh / kv > 2 ; and i give a dynamic programming recursion heuristic of md. furthermore, i study some stochastic vehicle routing problem also

    並證明了在距離約束的vrp情形下對于目標函數mv （車輛數最小） ，其任一有多項式時間的啟發式演算法h得到的車輛數目k ~ h和最優車輛數目k ~ v滿足關系k ~ h k ~ v 2 ，我們還給出了md （總距離最小）的一個動態規劃演算法。
  8. 2. polynomial - time approximation schemes ( ptas ) lemma 1 with 1 + cost, we can assume that all processing times and release dates are integer times of 1 +

    引理1在修正費用不超過1 。的情況下，可以將原實例的加工時間和到達時間修改為1 。的整數次冪
  9. Just like other optimization problems, coalition formation need search the optimal solution or quasi - optimal solution in a complex and huge space. if algorithm traverses the whole search space, search process will lead to combination explosion that make it impossible for algorithm to complete search in polynomial time

    與其它的最優化問題一樣，聯盟形成需要在復雜而龐大的搜索空間尋找最優解或滿意解，如果遍歷整個搜索空間，就會產生搜索組合爆炸，在多項式時間內無法完成搜索。
  10. Just like other optimization problem, coalition formation need search the optimal solution or quasi - optimal solution in a complex and huge space. if algorithm traverses the whole search space, search process will lead to combination explosion that make it impossible for algorithm to complete search in polynomial time

    與其他的最優化問題一樣，聯盟形成需要在復雜而龐大的搜索空間中尋找最優解或滿意解，如果遍歷整個搜索空間，就會產生搜索的組合爆炸，在多項式時間內無法完成搜索。
  11. Radio communications systems, department of signals, sensors and systems, royal institute of technology, 10044 stockholm, sweden, october 2002. 10 hajck b, wieselthier j. link scheduling in polynomial time

    絕大部分方法在網路中有20 30個結點， 100 200條鏈路時就需要花幾天甚至更多的時間來尋找最優調度。
  12. An approximation algorithm a2 - 1 with absolute performance ratio 3 / 4 is proposed and the asymptotic performance ratio of a2 - 1 applied to the problem in which machines require prepare times is 2 / 3. another problem is two parallel machines scheduling to maximize the number of just in time jobs. for this problem we give a polynomial time optional algorithm in the case early penalty is larger or equal to late penalty, and it is proofed to be np - had when early penalty is less than late penalty

    第二章所討論的另一個問題是帶提前和延誤懲罰的兩臺機排序極大化justintime完工工件數問題，當提前懲罰大於或等於延誤懲罰時，本文提出了該問題的一個多項式時間最優演算法a _ （ 2 - 2 ） ，從而證明了該問題是一個p問題，當提前懲罰小於延誤懲罰時，我們證明了該問題是一個np難的問題。
  13. Because it can " t finish in polynomial time, the scheduling problem is known to be np - hard

    由於該問題不能在多項式時間內求得最優解，因而被公認為一個np完全問題。
  14. System to place observer on a polyhedral terrain in polynomial time. image and vision computing, dec. 1996, 18 : 773 - 780

    第3步：結點和根據頂點選擇演算法vertex selection algorithm為s和t選擇合適的頂點和
  15. The complexity of kf - diff is o ( nlogn ), while n is the number of the nodes in the tree, vs. polynomial time for previous algorithms

    在演算法復雜度上從先前的多項式時間提高到o （ nlogn ） ，其中n為文檔結點數。
  16. It is shown that these four types of single machine scheduling problems can be modeled as an assignment problem by mathematical programming method, thus these four types of problems can be solved in polynomial time

    用數學規劃的方法證明了四類多準則下的單機排序問題可以轉化為指派問題，從而這四類問題都多項式時間可解。
  17. A set of algorithms are designed to address the two challenges and then a service pool can be automatically constructed and managed for given reliability and performance requirements in polynomial time

    為此，我們設計了一組演算法，在給定的可靠性和性能范圍內，通過演算法的調度，可以在多項式時間內對服務池自動地進行構造和管理。
  18. We prove that the worst - case ratio of algorithm d is 15 / 13, which is better than any other approximation algorithm except polynomial time approximation scheme considering with both worst - case ratio and time complexity

    我們證明了對三臺機情形，演算法d的最壞情況界為15 13 ，該演算法的最壞情況界和時間復雜性優于除近似方案以外的已有近似演算法。
  19. Problem c and problem d are also dual. they have a dual property that there are at least three " critical points " corresponding to an optimal straight - line in problem c and there are at least three " critical straight - lines " corre - sponding to an optimal point in problem d. from these properties, these four non - linear prob - lems could be transformed into combinatorial problems and could be solved by algorithms with polynomial - time iterations

    問題c和問題d也是對偶問題。問題c和問題d也有很好的對偶性質：在問題c中，對應於一條最優直線，至少存在三個「臨界點」 ；在問題d中，對應於一個最優點，至少存在三條「臨界直線」 。基於這種性質，這四個非線性優化問題便轉化為組合問題，從而得到迭代次數為多項式的演算法。
  20. In this thesis, firstly, the existing heuristic algorithms for steiner tree problem are summarized ; secondly, a research and analysis is made on the multicast trees that satisfy qos requirement and a fast routing algorithm for delay - constrained low - cost multicast is presented. through simulation, we find that the proposed algorithm is simple and can get the low - cost tee in polynomial time. at last, the multicast routing and wavelength assignment in wdm optical networks is studied ; a routing and wavelength assignment in wdm all - optical networks is presented

    本論文首先綜述了多播路由問題的理論基礎，接著對滿足qos約束的多播路由問題進行了研究，提出了一種快速的時延受限最小代價多播路由演算法，該演算法簡單、快捷，能在多項式時間內找到滿足時延約束的代價較小的多播樹，具有良好的性能；最後，研究了wdm光傳送網中的多播路由和波長分配問題，並提出了wdm全光網路中的多播路由與波長分配演算法，該演算法將路由和波長分配統一進行，構造了時延受限低代價多播樹，克服了將尋徑和波長分配分步進行的弊端，避免了同類演算法的較高復雜性。
分享友人
分享到 Line

分享到臉書