divide and conquer algorithm 中文意思是什麼

divide and conquer algorithm 解釋
分治法
  • divide : vt 1 分，區分，劃分 （into）。2 分配，分派，分給；分享，分擔，分攤 （with; between; among）。3 分...
  • and : n. 1. 附加條件。2. 〈常 pl. 〉附加細節。
  • conquer : vt 1 征服；攻克；打敗（敵人）。2 克服（困難等），改正（惡習等）；抑制（情慾等）。3 〈古、詩〉贏得...
  • algorithm : n. 【數學】演算法；規則系統；演段。
  1. Abstract : an algorithm is presented for better legal solution in detailed placement of large scale mixed macros and standard cells ic design. due to the limitation of computing complexity, an effective and efficient initial placement is very important for detailed placement. novelty of this algorithm lies in a better solution at initial stage by using network - flow method to satisfy row capacity constraint and the thought of linear placement problem ( lpp ) to resolve overlaps. moreover, divide - and - conquer strategy and other simplified methods are adopted to minimize complexity. experimental results show that the algorithm can get an average of 16 wire length improvement on paflo in reasonable cpu time

    文摘:以大規模混合模式布局問題為背景，提出了有效的初始詳細布局演算法.在大規模混合模式布局問題中，由於受到計算復雜性的限制，有效的初始布局演算法顯得非常重要.該演算法採用網路流方法來滿足行容量約束，採用線性布局策略解決單元重疊問題.同時，為解決大規模設計問題，整體上採用分治策略和簡化策略，有效地控制問題的規模，以時間開銷的少量增加換取線長的明顯改善.實驗結果表明該演算法能夠取得比較好的效果，平均比paflo演算法有16的線長改善，而cpu計算時間只有少量增加
  2. We apply the divide - and - conquer strategy to this issue and develop algorithm dciua. it not only adopts the merits of divide - and - conquer method but also fully utilizes information of the original frequent itemsets under the old minumum support. so dciua is more efficient than the direct application of apriori under the new minimum support

    我們把分治策略的思想應用到更新問題上，設計了演算法dciua ，既利用了分治方法的優點，同時又充分利用已有的頻繁項目集的信息，因而演算法是有效的。
  3. Iii ) a parallel homotopy continuation algorithm based on divide - and - conquer is proposed

    Iii ）提出了一種基於分治策略的并行同倫連續方法。
  4. Basing on them, we propose a new algorithm of removing pseudo elements by which we can ensure the candidate edge generated by the broken line in 2d views is pseudo element if it is inside of the face which can be seen completely. at last delete other pseudo elements by the topological information of former methods. 2. for the low efficiency and bad capability of disposing multi - solutions of the decision - making after generating face loops, we thoroughly analyzed the former divide - conquer algorithm and decision - chaining algorithm

    以這些定義和定理為基礎，提出了新的假元刪除演算法，通過判斷視圖中的二維虛線邊所生成的候選邊是否在完全可見有界平面內來判斷該候選邊是否為假元而將其刪除，再結合前人的成果利用三維拓撲信息刪除其它假元，從而降低了面環的生成數目和決策求解的搜索空間，提高了三維重建的效率。
  5. As early as in 1975, shamos and hoey first gave an o n - lg n - time divide - and - conquer algorithm sh algorithm in short for the problem of finding the closest pair of points

    Shamos和hoey在1975年提出了在o n lg n時間內尋找平面內最近點對的分治演算法。
  6. After the paper sufficiently considered creation algorithmic of triangulated irregular network in time and space and analyzed three creation algorithms of tin - divide - conquer, triangulation growth, incremental insertion, the paper adopts to a new algorithm that takes advantages of divide - conquer and triangulation growth. it can create tin quickly. the paper also uses break lines, terrain feature lines, building borderlines to be restriction condition and creates triangulated irregular network based on restriction

    綜合考慮不規則三角網生成演算法的時間和空間性能，分析了常用的三種tin生成演算法：分割-歸並法、三角網生長法和逐點插入法，筆者採用分割-歸並法與三角網生長法相結合的演算法，快速生成了tin ，並以斷裂線、地性線、建築物邊界為約束條件，最終生成具有約束的不規則三角網。
  7. Shamos and hoey algorithm, divide and conquer, closest pair of points, complexity

    在1998年，周玉林等人對sh演算法進行了改進。
  8. Parallel divide and conquer algorithm with multisection for real symmetric band generalized eigenvalue problem

    計算對稱帶狀矩陣廣義特徵值問題的并行分治多分法
  9. Discussing the polygon union algorithms on the cgal and planar map platform. they are arrangement algorithm, incremental union algorithm and divide and conquer algorithm

    基於cgal的平面圖，討論了多邊形合併演算法：排列合併演算法、增量合併演算法以及divide與conquer演算法。
  10. Finally, the ability of applying the approved aco algorithm to msa is studied. the idea of divide - and - conquer is adopted to improving the progressive algorithm and the longest common subsequence of multiple sequences is proposed as the partition points of multiple sequences. also, the paper presents how to solve the longest common subsequence of multiple sequences by the approved aco algorithm for mcp

    最後，本文對改進的蟻群優化演算法在多序列比對問題上的應用進行了研究，採取分治思想改進現有的progressive演算法，提出利用最長公共子序列進行多序列分割的策略，並給出怎樣利用解決最大團問題的蟻群優化演算法求解多序列的最長公共子序列的方法。
  11. On the basis of the concepts of divide - and - conquer and rough - fine, dia build a set of algorithm models including two rough classifiers ( i. e. bdt and cmac ) and three fine classifiers ( i. e. clchfpp, cpn - wed, nne - ifm ) which integrate some techniques such as clustering, decision tree, neural networks, fuzzy logic and information fusion etc. and take advantage of them, so dia has a high accuracy and speed theoretically

    Dia系統中演算法模型的設計基於「分而治之」和「由粗到精」的模式識別思想，具體構建了兩種粗分器（ bdt和cmac ）及三種精分器（ clc - fpp 、 cpn - wed和nne - ifm ） ，這些分類器的設計綜合了聚類法、決策樹、神經網路、模糊邏輯以及信息融合等技術的應用，並使其優勢互補，因此在理論上具有識別精度高及速度快的優點。
  12. The advantage of this algorithm is that its computing quantity and computing time are less than the divide - and - conquer algorithm of k. y. li. with good parallelism in nature, it is quite suitable for parallel processing

    該演算法利用割線法迭代計算廣義特徵值，具有計算量少，計算速度快的優點，並且演算法具有內在并行性。
分享友人
分享到 Line

分享到臉書