Divide and conquer using master and affiliated documents.
使用主文档和附属文档分割大的文档，并克服大文档的问题。
So if I try to apply the same logic, well how can I divide and conquer this problem.
如果我想要用同样的逻辑，那么怎样划分，并解决这个问题呢？
Our algorithm employs the Divide and Conquer strategy, bisection and secants iteration.
该算法以二分法、割线法迭代为基础，采用分而治之策略。
In that case, try to divide and conquer. Break the problem into smaller parts you can more easily tackle.
这时候，试着去分解问题再逐一解决，把难题分解成更小的部分，令你解决起来更容易。
Even if the application is not well-written, it should be possible to employ some form of divide and conquer strategy.
即使应用程序写得不是很好，也应有可能实施某种形式的分而治之的策略。
Let me reiterate the essence of the introduced architectural approach based on the "divide and conquer" principle.
请允许我重申引入的基于“分治处理”原则的结构方法的精髓。
Merge sort takes this idea of divide and conquer, and it does the following: it says let's divide the list in half.
归并排序以如下的步骤使用了分治思想：，把列表分成两半：，下面就是分治。
The Algorithm of Finding Pair of Three-Dimensional Points with the Minimum Distance by Means of Divide and Conquer;
文中在分析已有算法的基础上，提出利用分治算法实现平面散乱点三角剖分。
But in the case that the algorithms fail to find the optimum solution, the divide and conquer algorithm is more accurate.
但在找不到最优解的情况下，最大互关联算法更精确。
The divide and conquer method is used very widely in many realms, especially on solving non-numerical calculating problems.
分治法在许多领域，尤其是非数值计算机领域中应用十分广泛。
It is the ultimate form of "Divide and Conquer" for at its very core are the assumptions that (1) We must fight each other in order to survive.
这是“分而治之”的终极形式，因其核心有2个假设，(1)我们必须相互斗争才能生存。
PDQ priority works on the basis of 'divide and conquer'. That is, Informix Dynamic Server breaks up complicated queries into much smaller pieces.
PD q优先级的工作原理是“各个击破(divide and conquer)”，InformixDynamicServer将复杂查询拆散成多个较小的部分。
This paper utilizes the "divide and conquer" method, solves the presented model, analyzes the model's problems, and finally points out the future's work.
本文采用了分而治之的方法，对提出的模型进行了求解，并通过分析模型存在的一些问题，指出了下一步的工作。
With the DPF "divide and conquer" processing, scalability can be enhanced within a single server (scaling up) and across a cluster of servers (scaling out).
通过DPF“分治(divide and conquer)”处理，可以增强单个服务器(向上扩展)和服务器集群(向外扩展)的可伸缩性。
The combat strategy game encourages users to build up its island-nation empire, recruit friends, and divide and conquer through battles, building, and bargaining. (Zynga)
在该款作战游戏中，用户可以建立岛国帝国，招募盟友，通过战争、重建、以及谈判等方式达到割据和征服的目的。
This approach might be analogous to establishing a stronghold within the code, from which you can launch small sorties of refactoring to divide and conquer the maintainability problems.
这种方法可能与建立代码中的堡垒类似，你可以只执行重构的一小部分，以分割并克服维护性问题。
It deals with the XML on a small scale through a divide-and-conquer approach, rather than a monolithic query.
它采用分而治之的方法在较小的范围内处理XML，而不是单一的查询。
To reduce downtime and risk, a divide-and-conquer methodology was applied to migrate WebSphere Commerce from release to release.
为减少停机和风险，从一个版本到另一个版本的WebSphereCommerce迁移采用了分而治之的方法。
Rather than analyze the entire document every time you enter text, the CDT USES the divide-and-conquer approach provided by the Eclipse text editor API.
CDT并不在每次键入文本时分析整个文档，而是使用由eclipse文本编辑器api提供的分而治之的策略。
This simple statement captures two approaches that can be employed to solve a problem: a "divide" and b "conquer."
这一简单的语句运用了两种方法来解决一个问题：a“分解”和b“解决”。
Divide-and-conquer is a recursive technique, meaning that it uses some method to split a problem in half, then uses the same method to split those halves in half, and so on.
分治是一种递归算法，就是指利用一种方式把问题一分为二，然后用同样的方法把已分开的问题再一分为二，直到满足最小的解决单元。
The divide-and-conquer strategy means continually splitting up and recombining data, as they're passed between different cores.
分治策略需要连续性地分割和重组数据，以使数据能在不同核之间被传送。
The second HPC pattern, divide-and-conquer, is also known as highly parallel execution.
第二种HPC模式，即分治模式，也称为高并行执行。
Divide-and-conquer algorithms are often useful in sequential environments but can become even more effective in parallel environments because the subproblems can often be solved concurrently.
divide - and - conquer算法也可用于顺序环境中，但是在并行环境中更加有效，因为可以并行处理子问题。
Each of these problems can be easily parallelized using divide-and-conquer, and can be easily represented as fork-join tasks.
其中的每个问题都可以用divide - and - conquer轻松地并行化，并能轻松地表示为fork - join任务。
A typical parallel divide-and-conquer algorithm takes the form shown in Listing 1.
典型的并行divide - and - conquer算法的形式如清单1所示。
Listing 1. Pseudo-code for generic divide-and-conquer parallel algorithms.
清单1.通用divide - and - conquer并行算法的伪代码。
Listing 1. Pseudo-code for generic divide-and-conquer parallel algorithms.
清单1.通用divide - and - conquer并行算法的伪代码。
应用推荐