greedy algorithm 中文意思是什麼
greedy algorithm
解釋
式演演算法-
It is, of course, very easy to improve the efficiency of the greedy algorithm.
當然，貪婪演算法的有效性是很容易改進的。 -
A modified greedy algorithm for ldpc encoder implementation
編碼中貪婪演算法的改進 -
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 。 -
Greedy algorithm for besov classes
類上的貪婪演算法 -
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模擬軟體進行驗證。 -
In the design of corpus, we carefully analyze the syllable distribution of corpus th - coss, then classify the prosodic characters of this corpus and present out the distribution of every prosodic character. based on prosodic character vector, we construct an error function which is used to select original corpus for simulation system, and show the distribution of prosodic characters for the original corpus. greedy algorithm and corpus self - adaptive process are expatiated to set theoretical foundation for text material search
在語料庫分析與設計方面，首先統計th - coss語料庫中音節分佈情況，給出th - coss語料庫韻律特徵分類，並對每一種韻律特徵進行統計，然後構造了一個基於韻律特徵向量的誤差函數，並採用該誤差函數提取語料組成模擬系統的初始語料庫，分析該庫的韻律特徵分佈，最後闡述了greedy演算法與語料自適應過程，為文本語料的搜索打下理論基礎。 -
Combined with the two greedy algorithms, we also give a combinative - choice greedy algorithm
並且，結合這兩種貪婪演算法，我們還提出一個混合貪婪演算法。 -
At the same time, a greedy algorithm is used to eliminate the crossing - conflicts between translation boundaries of source language phrases
同時利用貪心演算法消除源語言短語譯文邊界之間的交叉沖突。 -
Based on analyzing the mathematical models for one - dimensional cutting stock problem, a greedy algorithm has been constructed, which is an approximate algorithm
摘要在對一維下料方案數學模型分析的基礎上，提出了一種基於貪心演算法的求解方法。 -
A greedy algorithm for aligning dna sequence. jounal of computational biology, 2000, 7 12, 1 2 : 203 - 214. 9 singh r k, dettloff w d, chi v l et al
基於這一體系結構特點，本文對megablast程序的流程進行了優化，採用對庫造表的策略，實現了計算和輸出的重疊。 -
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
用貪心演算法對使用仿射模型跟蹤時，由於目標運動和視角變化而產生的非仿射變形進行補償。 -
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
用改進的貪婪演算法求得能量函數最小值，提取出運動目標的精確輪廓，從而得到具有精確邊緣的運動目標。 -
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背包問題，提出一種具有修復策略的、貪心演算法與二進制粒子群演算法相結合的混合智能演算法。 -
Firstly, this article solves problems in the uighur text analysis, such as syllable separation, and summarize stress ? pause and tone rules of prosodic based on the features of the uighur language and phonetics. then propose the design of ? context vector ?, and uses greedy algorithm to optimize corpus. at last, this article introduces synthesis method using variable - length concatenating units
首先根據維語的語音和語言特徵，解決了音節劃分等有關文本分析的問題，並總結了重音、停頓、語氣等韻律規則；然後採用「語境矢量」的設計，用greedy演算法優化語料庫；最後採用不定長單元的拼接合成方法，首先選擇較大單元合成，當拼接單元為音節時，用viterbi演算法，基於語境挑選出最優的單元合成語音。 -
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 ）方法原理和當前的發展狀況，在此基礎上對能量函數進行了改進，並與貪婪演算法相結合，實驗效果良好。 -
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問題，該如何求解呢 -
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三角化為基礎，改進了頂點選擇的判據，並針對不同類型的多邊形採用不同的三角化策略，實現了穩定高效的三角化。 -
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貪婪法，並討論了遺傳演算法在檢測器集生成中的應用。 -
Therefore, the original optimization model is transformed into the problem of cross sectional area optimization. this paper had great research on the development of optimization algorithm by analyzing typical optimal search method, such as greedy algorithm, simulated annealing algorithm, neural network and genetic algorithm ( ga ). according to the characteristics of truss structure, we choose genetic algorithm as the solution way
本文在研究優化演算法發展過程的基礎上，分析了典型的優化搜索方法：確定性演算法如貪婪演算法，隨機搜索演算法如模擬退火演算法，人工智慧演算法如神經網路及遺傳演算法，根據桁架結構優化的特點，最終選擇以遺傳演算法作為桁架結構優化設計的主要演算法。 -
Two interactive segmentation methods, snake ( active contour ) and live wire, which are very popular, have been introduced for the medical image segmentation. a snake is a spline curve, which is controlled by an energy equation. to minimize the snake ' s total energy, the finite difference and greedy algorithm have been implemented
論文引入了snake和livewire兩種十分流行的醫學圖像交互分割方法，詳細推導snake的能量方程，實現了最小化能量方程的有限差分和greedy兩種演算法，並利用鄰近圖像的相似性，將其成功應用於圖像序列的分割； livewire是一種象素級的輪廓搜索演算法，它在方向圖中找到開始點和目標點之間的最小代價路徑。
分享友人