貪心演算法 的英文怎麼說

中文拼音 [tānxīnyǎnsuànfǎ]
貪心演算法 英文
greedy algorithm
  • 貪 : Ⅰ動詞1 （慾望不滿足; 求多） have an insatiable desire for; be greedy for 2 （片面追求; 貪圖） han...
  • 演 : 動詞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 （標...
  • 貪心 : 1. （貪得的慾望） greed; avarice; rapacity2. （貪得無厭; 不知足） greedy; avaricious; insatiable; voracious
  1. To deal with the question that how we can guarantee the dna sequences which are stored in the personal dna database are anonymous, that no one can find out whom a special dna sequence is collected from, this paper get a new method ? savior, by improve dnala ( dna lattice anonymization ), which is a method settling this question. savior replaces the multiple alignment in dnala with pairwise alignment between every tow sequences, and replaces the greedy algorithm in dnala with stochastic hill - climbing. for doing this, it can save the time for data pretreatment, and add the precision of classing

    針對個人dna數據的隱私保護問題，即:如何保證無法將存儲在數據庫中的dna序列信息與其提供者的個人身份信息（如:姓名，身份證號碼等）聯系起來，本文對一種新近開發的隱私保護方法? dnala （ dnalatticeanonymization ）進行了改進，在數據預處理階段，用兩兩雙序列比對代替了原演算法中的多序列比對，在不降低處理精度的情況下減少了數據預處理所耗費的時間;用隨機爬山法代替了原演算法中的貪心策略，增加了演算法後期處理的精度，從而形成了一種新的演算法? savior 。
  2. At the same time, a greedy algorithm is used to eliminate the crossing - conflicts between translation boundaries of source language phrases

    同時利用貪心演算法消除源語言短語譯文邊界之間的交叉沖突。
  3. Based on analyzing the mathematical models for one - dimensional cutting stock problem, a greedy algorithm has been constructed, which is an approximate algorithm

    摘要在對一維下料方案數學模型分析的基礎上，提出了一種基於貪心演算法的求解方法。
  4. A feature refreshing method during tracking is studied. greedy algorithm is used to compensate non - affine deformation caused by the changes of view and target ' s movement

    用貪心演算法對使用仿射模型跟蹤時，由於目標運動和視角變化而產生的非仿射變形進行補償。
  5. Bell system technical, 1970, 49 : 291 - 307. 10 wu f, huberman b a. finding communities in linear time : a physics approach. eur

    本質上， dm演算法是一種啟發式的貪心優化演算法，它採用局部搜索方法能逐步逼近地為預先定義的目標函數找到一個近似最優解。
  6. Semi - closed cube is a generalizationof condensed cube and quotient cube and is constructed from a quotientcube

    我們提出了一個貪心演算法來解決該優化問題，基本思想是：
  7. A mathematical model is firstly proposed. then the greedy heuristic algorithm is applied to solve the model

    首先建立此問題的數學模型，並採用啟發式貪心演算法對模型進行求解。
  8. 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背包問題，提出一種具有修復策略的、貪心演算法與二進制粒子群演算法相結合的混合智能演算法。
  9. This paper starts with the introduction of the recent research and development on gis - based logistics distribution system at home and abroad. then the core issue in distribution process, the vehicle routing design is further studied. this project applies the greedy method to solve the vrp with step - by - step answers, which turns it into traveling salesman

    文中首先介紹了國內外基於gis物流配送系統的研究現狀，接著對配送中所需考慮的核心問題- - -配送車輛路徑規劃進行了研究，運用貪婪演算法將vrp問題進行分步求解，使之成為求k條路線的tsp ，再引入改進蟻群演算法來解決tsp問題。
  10. Following are detailed steps of this system : in the segmentation section, we use three successive frames to detect the motion infomation of the pictures, by using blockmatching algorithm in two successive frames twice, we can get two pictures composed of motion blocks of the moving object, then we find out the common motion blocks of the two pictures, experiments prove these blocks approximately compose the moving object. after getting the motion blocks, we calculate the center of these blocks as the center of the moving object, thus we can use the center point as the origin, construct n straight linesjoining the boundry of the image and the center. on each line, we can find out a proper point near the object contour according to some criteria, then we use these n points as the initial points of the snake and let the snake converge on the object contour, thus finish the segmentation of the moving object

    本方案的實現過程為：分割部分：對運動目標的前後三幀進行兩次塊匹配運動檢測，通過找出兩個匹配結果中運動圖像塊的公共部分，獲得組成運動目標的圖像塊；求出運動目標圖像塊的形心作為運動目標的中心，以此中心為端點，向四周發散出角度間隔為的n條射線，射線的另一端終止於圖像的邊緣；在每條射線上按照一定的準則（點的梯度和與目標中心的距離在一定閾值范圍內）找出n個初始輪廓點；以這些初始輪廓點作為主動輪廓模型（ snake ）的初始點，用改進的貪婪演算法使snake收斂到待分割的運動目標輪廓上。
  11. For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization, a heuristic search method is proposed, in which based on minimum spanning tree, degrees of vertices over the constrained degrees are reduced to the required state

    摘要針對網路設計和優化中度約束最小生成樹問題，提出了一種基於貪心思想的啟發式演算法求解度約束最小生成樹。
分享友人
分享到 Line

分享到臉書