greedy method 中文意思是什麼
greedy method
解釋
貪心法-
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 。 -
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
用貪心演算法對使用仿射模型跟蹤時，由於目標運動和視角變化而產生的非仿射變形進行補償。 -
According to the idea of column privoting qr method, we bring forward the greedy methods
數值試驗表明，分而治之方法比枚舉法要大大節省計算時間。 -
Consulting on the method of arrangement of shunting locomotives, the mathematical model of the arrival and departure lines occupying arrangement is set up. i apply the hybrid algorithm that combines greedy - selector into genetic algorithm to the question and get satisfactory answers
參照調車機車運用計劃的求解，建立到發西南交通大學博士研究主學位論文第11頁線佔用安排的數學模型，並將貪婪著色演算法和演化演算法混合起來運用於該問題，取得滿意解。 -
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
在分組的尋優上，我們借鑒了貪婪演算法的思想，提出了逐次最優選擇演算法，它是分裂與合併演算法的綜合，大量的數值計算表明該演算法與現有的幾種方法相比更有效。 -
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 ）方法原理和當前的發展狀況，在此基礎上對能量函數進行了改進，並與貪婪演算法相結合，實驗效果良好。 -
Greedy method with graded row action method for system of linear equations
線性方程組分級行處理法貪心方法 -
In fact, the dca program computes the slicing point with a greedy method and thus the speed of dca is not fast as expected
實際上， dca程序以一種貪婪方法計算分割點，而不能使dca程序沒有預期的快。 -
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問題。 -
In the solution, the 0 - 1 integer and real number mixed encoding technique was employed to describe an artificial fish ; behaviors of a fish were dispatched by its body energy status ; the following behavior was described by the greedy method where moving step is direct ratio to a fish ' s hungry degree ; the lowest survival body energy controlling technique was used to realize escaping policy from locally optimum positions ; the maximum iterating times and the changing degree of the optimum solutions during iterating were used to control the terminating time
在解算過程中，人工魚個體採用0 - 1整數和實數混合編碼方法描述；用人工魚體能累計和消耗程度來調度其行為；採用與饑餓程度成正比的移動步距的貪婪法描述個體追尾行為；採用最低生存體能控制來實現局部最優解逃逸策略；採用最大迭代次數和迭代過程中最優解平均值變化程度來控制迭代終止時機。 -
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三角化為基礎，改進了頂點選擇的判據，並針對不同類型的多邊形採用不同的三角化策略，實現了穩定高效的三角化。 -
The conclusion of some data statistical experiment also confirm that the ga do better in solving small scale problem while the greedy do better in solving large scale problem. four, two example for two different models was provided to prove the modeling and solving method is an effective one. last, a simple irs schedule tool which faces on area target was realized
該工具在模擬預處理、優化模型和求解演算法的基礎上，通過對stk軟體和matlab軟體的介面進行編程，具備了兩個軟體間的數據自動接收與轉換功能，實現了計算機自動執行從模擬預處理到模型求解的完整過程。 -
This paper study the greedy snake algorithms for the clutter tracking. it introduce the energy function of basic snake model and analyze the different kind of snake discrete energy function. it study on the method which use the pretreatment combining the sobel and grads arithmetic operators. the astringency of snake external energy was satisfied. this paper analyze the influence of tracking precision and running time for the preliminary border width, it also study on the tracking effect of different distributing and intensity. it is important to the next work
針對雜波數據的強度起伏大的特點，提出了結合sobel運算元和梯度運算元的預處理方法，滿足了貪婪snake外部能量的收斂要求，在真實數據和模擬樣本條件下，分析了初始邊框間隔對跟蹤精度、運行時間的影響，以及不同分佈、不同強度雜波樣本的跟蹤效果，為后續的工作打下基礎。 -
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
本文在研究優化演算法發展過程的基礎上，分析了典型的優化搜索方法：確定性演算法如貪婪演算法，隨機搜索演算法如模擬退火演算法，人工智慧演算法如神經網路及遺傳演算法，根據桁架結構優化的特點，最終選擇以遺傳演算法作為桁架結構優化設計的主要演算法。
分享友人