The problem is decomposed into three subproblems:1. The number of optimal empty car distribution;
将原问题分解为三个子问题：1．最优空车分配数；
In the map step, the document is taken by the master node and the problem is divided into subproblems.
在map步骤中，由主节点接收文档并将问题划分为多个子问题。
Long Range Transmission Planning (LRTP) is composed of two subproblems. the static strategy and dynamic strategy.
输电网中长期规划可分解成单阶段的静态决策和多阶段的动态决策两个子问题。
An optimal solution to the problem could be constructed from optimal solutions to subproblems of the original problem.
一个问题的最优解能够用原始问题的子问题的最优解构造得到。
These subproblems are then distributed to worker nodes, which solve the problem and return the results to the master node.
然后将这些子问题发布给工作节点，由它处理后再将结果返回给主节点。
The three values below correspond, respectively, to the values returned by the three recursive subproblems I listed earlier.
下面三个值分别对应着我在前面列出的三个递归子问题返回的值。
In each example you'll somehow compare two sequences, and you'll use a two-dimensional table to store the solutions to subproblems.
在每个示例中，都会比较两个序列，而且将使用二维表格存储子问题的解。
Dynamic programming is used when recursion could be used but would be inefficient because it would repeatedly solve the same subproblems.
在可以使用递归，但因为递归重复解决相同的子问题造成效率低下的时候，则可以采用动态编程。
We apply the popular trust region algorithm and truncated conjugate gradient algorithm with trust region skills to solve trust region subproblems.
应用目前流行的信赖域算法，并用带有信赖域技巧的截断共扼梯度法来解信赖域子问题。
The proposed method transforms the training problem into a number of convex subproblems which can be solved in shorter time to obtain globally solutions.
该方法将网络训练问题变换为一系列的凸规划子问题，而这些子问题都可以在较短时间内获得全局最优解。
Aircraft layout problem with performance constraints can be partitioned into finite subproblems, which overcome the on-off nature about optimal variables.
带性能约束的航天舱布局问题可分解为有限多个子问题，每个子问题克服了关于优化变量的时断时续性。
In this paper, a trust region algorithm for general nonlinear equality constrained optimization problems, is presented. The solution of their subproblems is easy.
对一般非线性等式约束最优化问题提出了一种信赖域算法，其子问题较易求解。
The naive implementation of this recurrence relation as a recursive method would have led to an inefficient solution involving multiple computations of subproblems.
用递归方法对这些递归关系的直接实现会造成解决方案效率低下，因为其中包含了对子问题的多次计算。
By means of domain decomposition, a large scale multidimensional problem is turned into several smaller discrete subproblems, which can reduce computing scale greatly.
而通过区域分解，我们可以把一个大规模的多维问题转化为若干个较小规模的子问题，从而大大减小计算规模。
But Listing 1's code is inefficient because it solves some of the same recursive subproblems repeatedly. For example, consider the computation of fibonacci1 (5), represented in Figure 1.
但是清单1的代码效率不高，因为它重复地解决相同的递归子问题。
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算法也可用于顺序环境中，但是在并行环境中更加有效，因为可以并行处理子问题。
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算法也可用于顺序环境中，但是在并行环境中更加有效，因为可以并行处理子问题。
应用推荐