貪婪演演算法 的英文怎麼說

中文拼音 [tānlányǎnyǎnsuànfǎ]
貪婪演演算法 英文
greedy algorithm
  • 貪 : Ⅰ動詞1 （慾望不滿足; 求多） have an insatiable desire for; be greedy for 2 （片面追求; 貪圖） han...
  • 婪 : [書面語]Ⅰ名詞（貪, 對吃喝無限制的慾望） greed; avariceⅡ形容詞（極度想吃喝的） greedy; avaricious
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 貪婪 : [書面語] avaricious; greedy; rapacious
  1. It is, of course, very easy to improve the efficiency of the greedy algorithm.

    當然，貪婪演算法的有效性是很容易改進的。
  2. Algorithm bls has a worst - case guarantee no more than 1 + b, the bound indicates that it becomes very poor in extreme cases where b is algorithm blpt provides worst case error bound 3

    演算法bls和演算法bedd得到一個性能指標為1 + b 。貪婪演算法qrlpt給出原問題的一個最差性能比為3 。
  3. A modified greedy algorithm for ldpc encoder implementation

    編碼中貪婪演算法的改進
  4. Greedy algorithm for besov classes

    類上的貪婪演算法
  5. In the leach - new protocol, the mainly improvement of the leach protocol exhibits as follow : for the sake of balancing the network load, the network choose the clusters based on the residual energy ; we take multi - hop communication between sensors instead of single - hop communication, which results in the reduction of energy consumption of clusters ; the new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link ; the algorithm for assigning tdma time slot reduces overall delays of network

    在leach - new協議中，對leach協議的改進主要體現在以下幾個方面:根據節點剩餘能量選擇簇頭，以平衡網路負載;節點間採用多跳路由，降低簇頭能量消耗;節點根據能量消耗的代價來選擇至簇頭的路由，通過擴散演算法來廣播代價消息，採用貪婪演算法來選擇能量消耗最小的路徑;採用tdma時隙分配演算法減少網路時延。最後，利用ns2模擬軟體進行驗證。
  6. Combined with the two greedy algorithms, we also give a combinative - choice greedy algorithm

    並且，結合這兩種貪婪演算法，我們還提出一個混合貪婪演算法。
  7. There are some numerical examples to show that the greedy algorithms work well. finally, we consider the numerical rank lrms

    這些貪婪演算法（特別是向後貪婪演算法和混合貪婪演算法）都能夠很好的得到所需的最優子矩陣。
  8. Finally, the solution of minimizing the energy function was obtained by using the modified greedy algorithm, after which, the precise contour of the object was extracted

    用改進的貪婪演算法求得能量函數最小值，提取出運動目標的精確輪廓，從而得到具有精確邊緣的運動目標。
  9. Based on this extended model, we then propose an oblivious algorithm that can route messages between any two nodes in o expected number of hops. our routing algorithm keeps only o beta 1 bits of information on each node, where 1

    Kleinberg證明了如果每個節點只用local的路由信息，簡單的貪婪演算法可以在o lg n 2的期望時間內完成任何兩點間的路由過程。
  10. The comparison results show that the left edge algorithm can only resolve the channel routing problem without vertical constraints, while the greedy channel router can accomplish the problem with vertical and horizontal constraints

    比較結果證明，左邊演算法只能解決不存在垂直約束的通道布線問題，而貪婪演算法在充分考慮垂直和水平約束的條件下能較好地完成布線。
  11. As a preliminary investigation of the channel automatic routing, some of the channel router algorithm, such as left edge algorithm, the dogleg algorithm, net merge channel router and greedy channel router, are analyzed

    作為通道自動布線的初步探索，論文分析了幾種常見的通道布線演算法如左邊演算法、狗腿演算法、合併演算法、貪婪演算法。
  12. A probabilistic algorithm of system - level fault diagnosis based on greedy principle

    基於貪婪演算法的系統級故障的概率診斷
  13. The proposed algorithm is compared with the methods based on dynamic programming and greedy

    與傳統的動態規劃法和貪婪演算法進行了比較實驗。
  14. Meanwhile, space decomposition was implemented by eight - branch trees structure in the process of the merger of couple - point which was selected by greedy choice algorithm

    在點時合併的過程中使用八叉樹結構進行空間分解，使用貪婪演算法來選擇點對。
  15. The simulation result indicates that the performance of bspso on knapsack problem, with a quicker convergence, is superior to the greed and genetic algorithms

    測試結果表明：採用該演算法求解0 / 1背包問題所得的最優解明顯優于貪婪演算法和遺傳演算法，且有較快的收斂速度。
  16. Based on ripper, some modification was proposed to adapt the intrusion detection environment, resulting in the multi - greedy and coupling ( mgc ) rule induction learning algorithm

    本文在ripper演算法的基礎上，進行了適太原理工大學碩士研究生畢業論文應入侵檢測環境的改造，提出了多級貪婪禍合規則歸納演算法。
  17. For the first problem, the successive best selection method is presented based the idea of the greedy method. it is the synthesis of fission and assemble methods. some numerical comparison about them is also given

    在分組的尋優上，我們借鑒了貪婪演算法的思想，提出了逐次最優選擇演算法，它是分裂與合併演算法的綜合，大量的數值計算表明該演算法與現有的幾種方法相比更有效。
  18. This paper introduces principle of fractal and the mandelbrot fractal theory. it analyze the fractal character and study the mltifractal for the clutter tracking. in according to the rage which follow the q on point fractal dimension and region fractal exponent. we confirm the prepreerence multifractal high moment, combining the clutter feature of pd radar and novel multifractal approach, the mainlobe clutter tracking come true

    以單點分形維數和區域分形指數隨q值的變化程度為標準，確定了多重分形最優高階矩數，結合pd雷達的雜波特性和多重分形演算法，實現了主瓣雜波跟蹤;研究了貪婪snake方法在雜波跟蹤中的應用，介紹了snake基本模型的能量函數，並分析幾種常用的snake模型的離散能量函數。
  19. We can also see that these algorithms have better performance than the majority algorittim and compete algorithm, which are classic probabilistic algorithm in system level fault diagnosis. a distributed hierarchical diagnosis algorithm is discussed for virtual private networks

    對于診斷正確率，貪婪演算法遠遠好於majority演算法，並好於compete演算法；對于時間復雜度，與majority演算法相當，均為o （ n ~ 2 ） ，要好於compete演算法。
  20. 3. the theory of the active contour method is introduced systematically, and an improvement of energy function is presented. the experiments with the greedy algorithm give a good result

    3 .系統介紹了主動輪廓線（ snake ）方法原理和當前的發展狀況，在此基礎上對能量函數進行了改進，並與貪婪演算法相結合，實驗效果良好。
分享友人
分享到 Line

分享到臉書