最優搜索演算法 的英文怎麼說

中文拼音 [zuìyōusōusuǒyǎnsuànfǎ]
最優搜索演算法 英文
optimal searching algorithm
  • 最 : 副詞（表示某種屬性超過所有同類的人或事物） most; best; worst; first; very; least; above all; -est
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 演 : 動詞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 （標...
  • 最優 : optimal; optimum最優策略 optimal policy; optimal strategy; 最優設計 optimum design; 最優值 optima...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically

    首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  2. This paper presents an approach to perceptually extract multi - oriented text lines from online handwriting. the approach adopts a bottom - up strategy. by the approach, strokes are first merged into blocks analogous to words, then a link model is constructed upon these blocks. finally, the optimal text line layout is found out by a branch - bound search on the link model. the experimental results show that the approach is effective and also available to extract curved text lines

    提出一種多方向手寫筆跡文本行的提取方法.該方法以視覺感知理論為基礎，採取自底向上的策略，先將筆畫組合成類比字元的筆畫塊，然後基於這些筆畫塊建立鏈接模型，最後採用分支限界搜索演算法從鏈接模型中找出最優行排列.實驗結果表明，該方法能有效地提取多方向筆跡行結構，並適用於彎曲文本行的提取
  3. Finally, considering the advantages and disadvantages of these algorithms, a trade - off algorithm is proposed. a corresponding vlsi coding circuit system is designed and verified with fpga

    最後結合各個演算法的優點，綜合考慮各方面性能，給出一個折衷的快速搜索演算法，並且設計出與演算法對應的編碼電路系統。
  4. Genetic algorithm, as a computational model simulating the biological evolution process of the genetic selection theory of dar - win, is a whole new global optimization algorithm and is widely used in many fields with its remarkable characteristic of simplicity, commonability, stability, suitability for parallel processing, high - efficiency, and practibility. on the other hand, there are many op - timization problems in the field of digital image processing, such as image compression, pattern - recognition, image rectification, image segmentation, 3d image recovery, image inquiry, and or so. in fact all these problems can be generalized as the problem of searching for a global optimal solution in a large solution space, which is the classic application field of genetic algorithm

    遺傳演算法是模擬達爾文的遺傳選擇和自然淘汰的生物進化過程的計算模型，是一種新的全局優化搜索演算法，具有簡單通用、穩定性強、適于并行處理以及高效、實用等顯著特點，在很多領域得到了廣泛應用，另一方面，在圖像處理領域有很多優化問題如圖像壓縮，模式識別，圖像校準，圖像分割，三維重建，圖像檢索等等，實際上都等同於一個大范圍搜索尋優問題，而最優化問題是遺傳演算法經典應用領域，因此遺傳演算法完全勝任在圖像處理中優化方面的計算。
  5. Our system model is a simplified one which is convenient for simulation experiment. our research is the first one which use optimal search theory to optimize the resource retrieval system. we focused on the optimal mobile agent dispatching, the initial searching parameters dicision and updating mothods. we extended ns2 network simulator to support mobile agent simulation and did several experiments under this simulation

    本文首次將最優搜索理論用於資源檢索系統的優化，通過在系統中增加最優分派器進行移動agent的最優分派，重點研究了使用最優搜索理論進行系統優化的方法，並對最優搜索演算法的初始參數確定、動態參數更新以及具體實現做了深入研究，實現了一致最優演算法。
  6. E3d r - tree takes into account the features of moving object data and takes advantage of new cost parameters. in particular, least - cost - first search algorithm is used in the insertion algorithm to find the overall best way to insert a new record in e3d r - tree. the proof of the vidility of the algorithm is given

    在e3dr - tree中，結合移動對象數據特徵引入空白區域作為新的插入代價參數，同時，在插入演算法中利用最小代價優先搜索演算法確定全局最優插入路徑，並給出演算法正確性證明。
  7. Powell algorithm which does not compute gradients and brent algorithm were used to search the optimal rotation and translation parameters, while multi - resolution searching strategy leads to a fast image registration

    在尋找最優的旋轉和平移參數時，採用了無需計算梯度的powell直接搜索演算法和brent演算法，並通過多分辨的方式加快圖象配準速度。
  8. With the support of hardware devices such as dsp chip, this arithmetic has effective application on complicated practice source coding. this paper alse applies wavelet to multicarrier modem / demodem transfer. the use of the induced wavelet package improves this arithmetic to search best wavelet package basis, and boosts up the support to multirate

    本文同時應用小波變換到多載波調制解調傳輸方面，通過推導出誘導小波包，改進最優小波包基搜索演算法，增強了對多碼率業務的支持性，在多載波傳輸系統中，是有效的提高信干比的方法。
  9. The search algorithm makes use of rewritting rules to get a set of equivalent b _ schemas, utilize the cost model to estimate the cost of each b _ schema and iterative search the min - cost b _ schema

    引入一種搜索演算法進行優化處理。該演算法利用改寫規則得到一組等價的b _ schema集合，對b _ schema進行代價估計、比較，迭代得到代價最小的b _ schema 。
  10. In this paper ， an optimal search strategy by dividing the whole surveillance area into regions is presented so that the optimal search can be adaptively implemented in phased array radar. firstly ， the inherent relationship among average discovering time ， radar resources consumption ， search frame period and target distribution density is studied. secondly ， parameters for the region search are optimized to achieve the optimal search performance inside regions. then ， the optimal search frame period for each region is derived to minimize the average discovering time of targets ， where the constraint of radar time resource and the importance of each region are taken into account. finally ， the adaptability of this search strategy is discussed. only if the optimal parameters for each region are utilized and the beams are scheduled according to the optimal frame period under the radar time constraint ， the optimal distribution and the optimal scanning sequence of beams can be implemented adaptively. thus ， optimal search is adaptively implemented in the whole surveillance area

    本文提出一種分區搜索演算法，實現了相控陣雷達的自適應最優搜索.首先，研究了各區域平均發現一個目標消耗的雷達資源和目標被發現的平均時間同搜索幀周期以及目標強度的關系；然後，研究了在各區域採用兩步搜索演算法的最優參數設計，實現了局部區域的最優搜索；其次，在雷達時間資源有限和區域重要性加權的約束條件下，導出了使目標被發現的平均時間最小的區域最優幀周期；最後，討論了分區搜索演算法的自適應性.只要採用各區域的最優參數，按最優幀周期調度雷達波束，就可以自適應地實現使目標被發現的平均時間最短的波束的最優分佈和掃描順序，即自適應最優搜索
  11. Conventional clustering criteria - based algorithms is a kind of local search method by using iterative mountain climbing technique to find optimization solution, which has two severe defects - sensitive to initial data and easy as can get into local minimum

    傳統的基於聚類準則的聚類演算法本質上是一種局部搜索演算法，它們採用了一種迭代的爬山技術來尋找最優解，存在著對初始化敏感和容易陷入局部極小的致命缺點。
  12. The research for key techniques of turbo codes is processed. it includes, ? the design of optimal component codes and the performance of asymmetric turbo codes are analyzed ; ? a search algorithm for short random interleaver based on the distance spectrum and ids criteria is carried out and simplified ; ? random puncturing method to improve the weight distribution of turbo codes with some special code rates is analyzed and simulated. ? the effect of different schemes of trellis termination to the performance of turbo codes is analyzed ; ? a new low complexity decoder structure is provided ; 5

    對turbo碼的部分關鍵問題進行分析和改進，主要包括： ?分析了最優分量碼的設計和非對稱turbo碼的性能； ?設計了基於距離譜和ids的短隨機交織器搜索演算法並進行了簡化； ?提出了採用隨機刪余方式改善特定高碼率turbo碼重量分佈特性的方法； ?分析了不同編碼器狀態歸零方案對turbo碼性能的影響； ?提出了一種降低實現復雜性的turbo迭代譯碼器結構。
  13. An improved method of de - noising via wavelet threshold and its implementation based on matlab

    基於最優投影和動態閾值的最近鄰搜索演算法
  14. Search algorithm, definition of sort, insertion sort, quick sort, optimal sort time, merge sort, heap sort, radix sort, summarize of sort algorithms

    搜索演算法；排序定義；插入排序；快速排序；最優排序時間；歸並排序；堆排序；基數排序；排序總結。
  15. The main idea of this hybrid algorithm is : at first, all candidates in task collection is lined according to a dispatching rule ( earliest due date, edd ), then this linear queue is divided into some tiers under a criterion that partial order is not allowed to exist in the every tier, many feasible sequences is generated by constructing a neighborhood of a initial sequence in every tier, the allocation of the resources over time is conducted to perform every feasible task sequence, and a set of approximate optimal scheduling schemes is achieved as the precondition of the next tier ’ s disposal in meeting multiple scheduling objectives to obtain the global near - optimal schedule which makes these program run tier by tier until the last task is completed

    該演算法按照最早完工時間優先（ ect ）分派規則，先將參加排序的工序合併成一個串列序列，然後按照同層內不存在偏序關系的原則，將其分解為若干個時間上相互銜接的層次，在每個層次內部，通過構造鄰域產生出多個可行序列，對每個可行序列進行設備配置，採用鄰域搜索演算法進行方案的尋優，保留一組滿足評價要求的可行方案作為下一層設備配置的背景環境，通過層層遞進最終獲取全局的近似最優解。
  16. A heuristic optimization path - finding algorithm based on dijkstra algorithm

    演算法的啟發式最優路徑搜索演算法
  17. Finally, the thesis points out the advantage of using tabu search to solve system identification problem and some problems waiting to be solved in this area

    最後作者對全文做出總結，提出禁忌搜索演算法優勢所在，並提出利用禁忌搜索演算法解決辨識問題中還需研究的問題。
  18. For video images with moving objects, an optimal stitching line was found by heuristic optimal path search algorithm in mosaics of images, and the images were smoothed by multi resolution theory after mosaics of images

    對存在運動物體的視頻圖像，採用啟發式最優路徑搜索演算法尋找到圖像間拼接的最佳縫合線，並使用多解析度原理進行圖像拼接后的平滑處理。
  19. Further more, we improve the nearest neighbor approximation method by calculat e mixtures ordered by likelihood of being the best scoring mixture. the likelihood is calculating from previously processed data. this improved method can reduce recognition time by 15. 56 % compared with standard viterbi beam search algorithm

    本文對最近鄰快速估算方法進行改進，在搜索過程中根據已處理過的數據統計出各個高斯混合分量產生最高對數概率的概率，並依此預測隨后的計算中最有可能產生最高對數概率的高斯混合分量，優先計算更有可能產生最高對數概率的高斯混合分量，使標準viterbibeam搜索演算法的搜索速度提高了15 . 56 。
  20. Genetic algorithm is a widely concerned global search algorithm, which has good parallel search ability for having pioneered the implementation of methods that exploit the idea of combining solutions, while tabu search has pioneered the systematic exploration of memory functions in search processes, having good local search ability because of its flexible memory mechanism and respective tabu criteria to avoid circuit search

    遺傳演算法是一種受到廣泛關注的全局優化演算法，開創了在解空間中從多出發點搜索問題最優解的先河，具有很強的并行搜索能力，而禁忌搜索演算法是在搜索過程中使用記憶功能的先驅者，以其靈活的存儲結構和相應的禁忌準則來避免迂迴搜索，具有較強的局部搜索能力。
分享友人
分享到 Line

分享到臉書