您要查找的是不是：
- Abstract data types satisfy the good programming principles of information hiding and divide and conquer. +抽象數據類(lèi)型符合了信息隱藏以及分而治之的良好編程原則。
- This paper introduces several kinds of paradigms in distributed and parallel programming.Compute-Aggregate-Broadcast (CAB), Divide and Conquer, Pipeline, and Processor Farm. 本文介紹了幾種分布式并行程序設計范例：計算-匯集-廣播、分而治之、流水線(xiàn)、處理機場(chǎng)等。
- 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. 該算法通過(guò)對曲面的參數域進(jìn)行預剖分，以及引入曲面上一點(diǎn)處的“最大絕對法曲率”的概念，采用“分而治之”的方法分片對參數曲面的參數域進(jìn)行三角形網(wǎng)格剖分。
- Divide your food and conquer overeating. 分開(kāi)包裝食物，戰勝飲食過(guò)量。
- the algorithm of divide and conquer 分治算法
- the strategy of divide and conquer 分治策略
- Divide and Conquer Algorithm on the Calendar Problems of the Round Robin 賽程問(wèn)題分治算法
- They have divided and conquered everywhere to create that frequency. 他們已經(jīng)被分開(kāi)和被征服來(lái)處處創(chuàng )造那頻率。
- They practised a policy of divide and rule. 他們實(shí)行分而治之的政策。
- To divide and dispense in portions. 分發(fā)，分配，分給分成并分發(fā)成幾個(gè)部分
- To divide and assign according to a plan;allot. 分配，分攤根據計劃分配；分派
- Command And Conquer 2 Tiberian Sun and Fire Storm ALL. 這是命令與征服2泰泊利亞之日。
- To divide and distribute proportionally;apportion. 分配，配給按比例分割并分配；分攤
- To divide and assign according to a plan; allot. 分配，分攤根據計劃分配；分派
- An Extended Divide and Conquer Algorithm for Solving Real Symmetric Band Generalized Eigenvalue Problem 求解對稱(chēng)帶狀廣義特征值問(wèn)題的擴展分治算法
- To divide and distribute proportionally; apportion. 分配，配給按比例分割并分配；分攤
- Divide and Conquer, Recursion, and Backtracking Methods--Thinking of the knight tour problem 分治,遞歸,與回溯--棋士巡游的算法研究
- PARALLEL DIVIDE AND CONQUER ALGORITHM WITH MULTISECTION FOR REAL SYMMETRIC BAND GENERALIZED EIGENVALUE PROBLEM 計算對稱(chēng)帶狀矩陣廣義特征值問(wèn)題的并行分治多分法
- Something divided and portioned out; a share. 一份，份額被分開(kāi)或分配的東西; 一份
- The Algorithm of Finding Pair of Three-Dimensional Points with the Minimum Distance by Means of Divide and Conquer 分治法實(shí)現最接近點(diǎn)對問(wèn)題的三維推廣算法
