greedy algorithms

"greedy algorithms"的翻譯和解釋

"查查詞典"手機版

千萬人都在用的超大詞匯詞典翻譯APP

例句與用法

The ga is an efficient one can find a better result when the scale of this problem is small and the greedy algorithm performs better when the scale of this problem is larger
最后,通過對多星區(qū)域觀測效率優(yōu)化工具及兩個具體的實例進行研究,在實踐上驗證了模型及算法的有效性。
As the basis of studying detector generation in eds , several new algorithms are presented . inspired by evolution computing , the thesis firstly analyzes rcb template and rcb greedy algorithm
借鑒進化計算的成果，提出檢測器集生成的rcb模板法和rcb貪婪法，并討論了遺傳算法在檢測器集生成中的應用。
Aimed at the 0 - 1 knapsack problems , the article proposes a kind of hybrid intelligence algorithm combining with the adjusting strategy , the greedy algorithm and the binary particle swarm optimization algorithm
摘要針對0 - 1背包問題，提出一種具有修復策略的、貪心算法與二進制粒子群算法相結合的混合智能算法。
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 )方法原理和當前的發(fā)展狀況,在此基礎上對能量函數進行了改進,并與貪婪算法相結合,實驗效果良好。
We also have the backward - choice greedy algorithm : if j is the column index subset which we have known , then we choose a column index j " from the subset j , such that which k is the rank of a ( : , j )
貪婪算法的思想是：每次“最貪婪的”從剩下的子矩陣中選擇一列添加到已知的子矩陣中，或“最貪婪的”從已知的子矩陣中消去一列。
If / is the column index subset which we have known , then we choose a column index i * from the residual subset i0 i , such that which k is the rank of a ( : , i ) . this method is called the forward - choice greedy algorithm
實際上，在第三章中，我們只是解決了原矩陣a是列可分的lrms問題，那么對于原矩陣a是列不可分的lrms問題，該如何求解呢
Based on greedy algorithm and grouping theory , four probabilistic diagnosis algorithms are presented , and each algorithm has different greedy criterion . experimental results show that every algorithm has high correctness and low time - complexity of diagnosis
每個算法均基于各自不同的貪婪準則；試驗結果表明，每種算法均表現出較高的診斷正確率，并且時間復雜度不高。
We have realized stable triangulation and striping methods in radm modeling system . triangulation method , which is based on delaunay triangle algorithm , has been improved on criterion of selected vertex , and striping used local optimize greedy algorithm
我們在radm系統中以delaunay三角化為基礎，改進了頂點選擇的判據，并針對不同類型的多邊形采用不同的三角化策略，實現了穩(wěn)定高效的三角化。
This main study of paper centralizes on following aspect : 1 . based on shortest path heuristic and greedy algorithms , using path similarity principle and genetic operations , provides a heuristic algorithms in finding multiple feasible paths for multiple constraints ( k - sph ) . 2
基于最短路徑( sph )和greedy算法，使用路徑相似性原：理和遺傳算法的變異操作，提出了尋找滿足1個或2個約束條件的多路徑啟發(fā)式算法(稱為k - sph算法) 。