greedy adj. 1.貪吃的。 2.貪心的,貪婪的 (for; after; of)。 3.渴望的,熱望的 (of; for)。 be greedy of gain [honours] 貪財(cái)[名]。 be greedy to do sth. 渴望[急欲]做某事。 adv. -ily ,-iness n.
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)化工具及兩個(gè)具體的實(shí)例進(jìn)行研究,在實(shí)踐上驗(yàn)證了模型及算法的有效性。
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 借鑒進(jìn)化計(jì)算的成果,提出檢測器集生成的rcb模板法和rcb貪婪法,并討論了遺傳算法在檢測器集生成中的應(yīng)用。
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背包問題,提出一種具有修復(fù)策略的、貪心算法與二進(jìn)制粒子群算法相結(jié)合的混合智能算法。
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 .系統(tǒng)介紹了主動輪廓線( snake )方法原理和當(dāng)前的發(fā)展?fàn)顩r,在此基礎(chǔ)上對能量函數(shù)進(jìn)行了改進(jìn),并與貪婪算法相結(jié)合,實(shí)驗(yàn)效果良好。
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 實(shí)際上,在第三章中,我們只是解決了原矩陣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 每個(gè)算法均基于各自不同的貪婪準(zhǔn)則;試驗(yàn)結(jié)果表明,每種算法均表現(xiàn)出較高的診斷正確率,并且時(shí)間復(fù)雜度不高。
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系統(tǒng)中以delaunay三角化為基礎(chǔ),改進(jìn)了頂點(diǎn)選擇的判據(jù),并針對不同類型的多邊形采用不同的三角化策略,實(shí)現(xiàn)了穩(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個(gè)或2個(gè)約束條件的多路徑啟發(fā)式算法(稱為k - sph算法) 。