divide and conquer 中文意思是什麼

divide and conquer 解釋
分步解決
  • divide : vt 1 分，區分，劃分 （into）。2 分配，分派，分給；分享，分擔，分攤 （with; between; among）。3 分...
  • and : n. 1. 附加條件。2. 〈常 pl. 〉附加細節。
  • conquer : vt 1 征服；攻克；打敗（敵人）。2 克服（困難等），改正（惡習等）；抑制（情慾等）。3 〈古、詩〉贏得...
  1. This divide - and - conquer strategy repurposes tested and proven open source assets and significantly reduces geronimo s overall development burden

    這種分開-整合策略使得經過測試和已證實的開源資源可用於不同的目的，並顯著減輕了geronimo的整體開發負擔。
  2. 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計算時間只有少量增加
  3. 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 ，既利用了分治方法的優點，同時又充分利用已有的頻繁項目集的信息，因而演算法是有效的。
  4. Topics covered include : sorting ; search trees, heaps, and hashing ; divide - and - conquer ; dynamic programming ; amortized analysis ; graph algorithms ; shortest paths ; network flow ; computational geometry ; number - theoretic algorithms ; polynomial and matrix calculations ; caching ; and parallel computing

    課程主題包含了：排序、搜尋樹、堆積及雜湊；各個擊破法、動態規劃、攤提分析、圖論演演算法、最短路徑、網路流量、計算幾何、數論演演算法；多項式及矩陣的運算；快取及平行計算。
  5. On the basis of set operation on integrity bo - dy, taking advanta ge of the excellency provided abundant topolo - gical information by the ra dial edge data structure, applying the divide and conquer method for inha ncing the efficiency of the system, the boolean operation on integrity or unintegrity bodys is furnished

    本文在正則形體集合運算演算法的基礎上，充分應用輻射邊結構提供豐富拓撲信息的優點，運用了分而治之的編程思想，實現了形體間的正則、非正則布爾運算。
  6. By pre - dividing parametric region of the surface and introducing the concept “ maximum absolute normal curvature ” at a point on the surface, the method adopts “ divide and conquer ” approach triangulating the parametric region of the surface piecewise

    該演算法通過對曲面的參數域進行預剖分，以及引入曲面上一點處的「最大絕對法曲率」的概念，採用「分而治之」的方法分片對參數曲面的參數域進行三角形網格剖分。
  7. Different parts in the same seamless system perform different tasks, and the use of oo method becomes the key point in the system integration of netfeaf. by making full use of some strategies like " from top to down ", " divide and conquer " and " step by step ", with the help of oo method, netfeaf creates a new method to build the whole integrated system : using one class hierarchy map to fully stand for the structure of netfeaf, and different parts in netfeaf like cluster class library, fea class library, web fea class library and gravity wharf cad class library can also be further explained by their sub class hierarchies, then the complexity of building netfeaf has been decreased step by step, the whole building procedure becomes much easier, so oo method can really change complexity into simplicity

    Netfeaf系統依據自頂向下、分而治之以及層層推進的實現原則，採用了全新的系統構造思路，對系統的集成用整體類庫組成圖進行表述，對各組成部分通過子類庫再進一步詳細介紹，系統的整體實現被一層一層分解、細化，各組成部分基於統一的計算核心集成在同一個系統框架內，同時相互之間還保持一定的獨立性，獨成一體，正是因為深入利用了面向對象的分析與實現手段，整個復雜系統構成從概念上更有利於理解，集成更加緊湊，具體模塊的實現也更加迅速高效，面向對象方法的變復雜為簡單的策略藝術在系統的具體實現過程中得到了充分展示。
  8. Iii ) a parallel homotopy continuation algorithm based on divide - and - conquer is proposed

    Iii ）提出了一種基於分治策略的并行同倫連續方法。
  9. Researched the methods to test configrable logic block ( clb ) and its sub - blocks. based on a “ divide and conquer ” methodology, the clb resources are divided into three basic blocks : logic units, carry logic module ( clm ) and lut ’ s ( look up tables ) ram - mode. the testing configurations are implemented based on a two - dimensional array structure for logic blocks

    主要基於「分治法」對clb及其子模塊進位邏輯（ clm ） 、查找表（ lut ）的ram工作模式等進行了測試劃分，分別實現了以「一維陣列」為基礎的測試配置和測試向量，以較少了測試編程次數完成了所有clb資源的測試。
  10. 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時間內尋找平面內最近點對的分治演算法。
  11. Abstract data types satisfy the good programming principles of information hiding and divide and conquer

    抽象數據類型給程序員提供了極大的機動性。
  12. Furthermore, we show when a matrix is column - divided and how to divide a matrix which is column - divided based on the classic qr factorization. numerical examples are also given to show that the divide - and - conquer method is efficient

    在此基礎上，我們進一步給出了判斷一個矩陣是列可分的可分準則，此可分準則利用數值代數中常用的qr分解得到。
  13. Tip : divide and conquer large xml documents

    技巧:對大型xml文檔分而治之
  14. Divide and conquer large xml documents

    對大型xml文檔分而治之
  15. Divide and conquer large documents

    對大型xml文檔分而治之
  16. Shamos and hoey algorithm, divide and conquer, closest pair of points, complexity

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

    計算對稱帶狀矩陣廣義特徵值問題的并行分治多分法
  18. 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演算法。
  19. 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演算法，提出利用最長公共子序列進行多序列分割的策略，並給出怎樣利用解決最大團問題的蟻群優化演算法求解多序列的最長公共子序列的方法。
  20. In chapter 3, we take a divide - and - conquer method to deal with lrms problem

    在第三章中，我們用分而治之的方法來求解lrms問題。
分享友人
分享到 Line

分享到臉書