polynomial time algorithm 中文意思是什麼

polynomial time algorithm 解釋
多項式時間演算法
  • polynomial : adj. 1. 【動、植】多詞學名的。2. 【數學】多項式的。n. 1. 【動、植】多詞學名。 2. 【數學】多項式。
  • time : n 1 時，時間，時日，歲月。2 時候，時刻；期間；時節，季節；〈常pl 〉時期，年代，時代； 〈the time ...
  • algorithm : n. 【數學】演算法；規則系統；演段。
  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. A polynomial time algorithm in positive define geometric programming with constraints

    約束正定式幾何規劃的一種多項式時間演算法
  3. In the terms of interpolation, the image reconstructed from nearest interpolation or linear interpolation has good edge but serious noise ; reconstruction from 4 * 4cubic interpolation or three b - spline or three - order lagrange interpolations has better local character. 2 x 2cubic interpolations which has both better edge and local character is the ideal interpolation, the following is the basic principle during reconstruction : ( 1 ) the more width of interpolation, the more number of summation and the more order of interpolation polynomial, the higher of density resolution ; ( 2 ) the more of interpolation polynomial and width of interpolation, the more of reconstruction time simultaneously, aimed at eliminating the effects of noise contained in projection data, in this paper, author analysis cause and effects of common artifacts. importantly, discusses convolution back - projection reconstruction algorithm with a shift axis of rotation has been derived for correcting images that acquired with a divergence axis of rotation using the fan beam geometry with an angle - equaled detector

    在ct圖像重建時，選擇有限帶寬窗有較好的空間解析度，三角形窗有較好的密度解析度，選擇餘弦窗則使得空間解析度與密度解析度的折衷；從窗函數的頻譜角度來講，可以用於圖像重建的一個良好的卷積窗函數應該具備以下條件： （ ? ）小的3db帶寬b ，即最小的主瓣寬度； （ ? ）最小的旁瓣最大峰值a ； （ ? ）最大的旁瓣峰值衰減速度d ；就內插函數而言，臨近點內插與線性內插重建圖像噪聲大，但有較好的邊緣與細節； 4 4三次內插、三次b -樣條與四次拉格朗日多項式內插圖像平滑，局部特性較好。
  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. The constructed surface is c2 continuous on the whole domain, and is a piecewise cubic parametric polynomial on every subdomains. the interpolating surface can preserve the convexity, concavity, inflection property and monotonicity of the data set. in the end, each algorithm brought forward in the paper is exemplified, at the same time, error is discussed

    3針對保形曲面插值問題，提出了一種插值于給定數據點集的參數型保形曲面插值演算法，所構造的曲面在整個區域上是c ~ 2連續的，在每個子區域上是分片三次參數多項式，並且保持被插函數集的所有子區域的邊界及其內部的軸向單調性、凸凹性以及拐點性質。
  9. Inimum network problem and its time - based polynomial algorithm

    最小網路問題及其多項式時間演算法
  10. 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

    與其它的最優化問題一樣，聯盟形成需要在復雜而龐大的搜索空間尋找最優解或滿意解，如果遍歷整個搜索空間，就會產生搜索組合爆炸，在多項式時間內無法完成搜索。
  11. 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

    與其他的最優化問題一樣，聯盟形成需要在復雜而龐大的搜索空間中尋找最優解或滿意解，如果遍歷整個搜索空間，就會產生搜索的組合爆炸，在多項式時間內無法完成搜索。
  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. This algorithm improves confidence in se by estimating parameters and states at the same time. simulation results on test power systems which range in size from 4 to 118 buses, have shown the virtues as follows : getting unbiased estimation without detecting and identifying bad data in measurements ; solving state and parameter estimation for power system with good convergence and excellent robust property ; increasing the numbers of iterations a little bit with the test systems expanded ; estimating many transformer taps simultaneously and remaining the main state estimation ; keeping the estimated relative error within + 0. 1 % and processing efficiently equality constraints and ill condition with polynomial complexity

    對ieee ? 4 118節點系統和廣西主網進行的模擬結果表明： l1范數估計具有不良數據拒絕特性，當量測量中存在不良數據時，該演算法在不經檢測和辨識不良數據情況下仍是無偏估計，具有良好收斂性，所需迭代次數隨著問題規模擴大而增長極小；能夠同時估計多個變壓器抽頭，並保持狀態估計主體；在滿足可觀測性條件下，估計的相對誤差保證在0 . 1以內；能夠有效處理等式約束和病態條件，並具有多項式時間性。
  14. The reseach work focused on the time delay estimation of the common practical radar singnals, including harmonics signal, chirp signal, polynomial phase signal, and phase - shift keying signal. the new algorithm for different radar signals are deduced in detail respectively, and simulation results are presented. the results proved that the new method is efficient for time delay and some other parameters estimation

    正弦信號、線性調頻信號、多項式相位信號、相位編碼信號是雷達信號中常用的幾種信號，對這幾種信號的研究是雷達信號處理中非常重要的內容，也是實際工程的需要。因此，本文選擇上述幾種信號作為研究對象，對這幾種信號的時延估計演算法進行了建模和理論推導，給出了時延估計演算法的具體表達式，並進行了計算機模擬。
  15. After that we study on the ordered decision table and propose a new heuristic attribute reduction algorithm based on dominance matrix, whose time complexity is polynomial

    再次，對有序決策表進行了研究，提出了一種基於優勢矩陣的啟發式屬性約簡演算法。
  16. 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 ，該演算法的最壞情況界和時間復雜性優于除近似方案以外的已有近似演算法。
  17. Numerical experiments with four test functions are performed, and some valuable conclusions are reached. first, the efficacy of full dominance - recessive diploid genetic algorithm outperforms the standard genetic algorithm ( sga ) in high - dimensional functions. the time complexity of the proposed ga approximates a polynomial multiple of that of sga

    通過對四個常用測試函數用完全顯隱性二倍體遺傳演算法和標準遺傳演算法進行初始解相同的對比試驗，表明完全顯隱性二倍體遺傳演算法在十維以上的高維函數優化問題中解的效果明顯優于標準遺傳演算法，對低維函數優化問題也不劣於標準遺傳演算法。
  18. 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全光網路中的多播路由與波長分配演算法，該演算法將路由和波長分配統一進行，構造了時延受限低代價多播樹，克服了將尋徑和波長分配分步進行的弊端，避免了同類演算法的較高復雜性。
  19. Multi - parent genetic algorithm ( mga ) is a heuristic search algorithm. mga has not been developed for a long time, but it has been preliminarily applied in many function optimization problem and many combinatorical optimization problem including nondeterministic polynomial completeness

    多親遺傳演算法是一種啟發式搜索演算法，它的發展時間並不長，但已經初步成功地應用到了一些函數優化問題、組合優化問題中，包括許多np完全問題。
  20. Polynomial interpolating compensation algorithm for the time - delay of active structural control system

    結構主動控制系統的時滯多項式插值補償演算法
分享友人
分享到 Line

分享到臉書