你可以通过子问题的局部最优方案从而得到全局优化解决方案。
You can get a globally optimal solution from locally optimal solutions to sub-problems.
使用更简单的子问题重新定义答案。
该子问题可通过模拟退火算法来解决。
正合列是模论中研究函子问题的基本工具。
The exact sequences are the basic means on studying the functors of module theory.
同时采用分散搜索算法求解单元调度子问题。
A scatter search approach is developed to solve cell scheduling sub-problem.
有时候，编写递归程序时难以获得更简单的子问题。
Sometimes when writing recursive programs, finding the simpler sub-problem can be tricky.
一个问题的最优解能够用原始问题的子问题的最优解构造得到。
An optimal solution to the problem could be constructed from optimal solutions to subproblems of the original problem.
下面三个值分别对应着我在前面列出的三个递归子问题返回的值。
The three values below correspond, respectively, to the values returned by the three recursive subproblems I listed earlier.
但是清单1的代码效率不高，因为它重复地解决相同的递归子问题。
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.
然后将这些子问题发布给工作节点，由它处理后再将结果返回给主节点。
These subproblems are then distributed to worker nodes, which solve the problem and return the results to the master node.
该算法通过构造子问题来寻找优于当前局部最优解的可行解。
In this algorithm, a subproblem is set up to search for a new feasible point at which the value of the objective function is lower than the current local minimum.
在每个示例中，都会比较两个序列，而且将使用二维表格存储子问题的解。
In each example you'll somehow compare two sequences, and you'll use a two-dimensional table to store the solutions to subproblems.
使用更小的或更简单的子问题(或多个子问题)来重新定义答案。
Redefine the answer in terms of a smaller or simpler sub-problem or sub-problems.
它通过快速的识别同源区域，把比对问题分成子问题予以解决。
Homologous regions are rapidly identified; the original alignment problem is divided into some sub-problems to solve.
首先将电力系统的全局优化问题分解为纯火电和纯水电的子问题。
At first, the global optimization problem, is divided into the purely thermal subsystems and purely hydroelectric subsystems.
该算法避免了在子问题的求解中使用效率较低的规划方法，提高了线计算的效率。
This algorithm avoids the dynamic programming in sub optimization problems, and improves the efficiency of the on line computations. The simulation results show the effectiveness of the new algorithm.
策略由基本调度策略和在线调整两部分组成，分别与模型的主问题和子问题相对应。
The master problem of the model corresponds to the basic scheduling strategy and the sub problem corresponds to on-line adjusting method.
集成策略的基本思想是把原问题分解为一系列的子问题，并采用合适的方法优化之。
The main idea of integrated strategies is to make the original problems be a series of sub- problems and choose appropriate method for optimization.
在可以使用递归，但因为递归重复解决相同的子问题造成效率低下的时候，则可以采用动态编程。
Dynamic programming is used when recursion could be used but would be inefficient because it would repeatedly solve the same subproblems.
基于区间分段思想，将极化曲线非线性参数辨识转化为两个线性最小二乘辨识子问题。
The nonlinear parameter identification of fuel cell polarization curve was converted into two sub-problems of linear least square identification based on interval segmentation technique.
应用目前流行的信赖域算法，并用带有信赖域技巧的截断共扼梯度法来解信赖域子问题。
We apply the popular trust region algorithm and truncated conjugate gradient algorithm with trust region skills to solve trust region subproblems.
映射是指把大量输入处理成更小的子问题集(然后把这些子问题分发给并行的工作系统)。
Map refers to the process of chopping input into a smaller set of sub-problems for processing (where these sub-problems are distributed to parallel workers).
这个问题可以分为四个子问题，即轮廓对应问题、分叉问题、拼接问题和曲面拟合问题。
The problem can be decomposed into four sub-problems, the correspondence problem, the branching problem, the tiling problem and the surface fitting problem.
提出的算法对整数变量进行搜索，并采用合并调度规则来求解整数解对应的调度子问题。
This scatter search approach interactively USES a combined dispatching rule to solve a scheduling sub-problem corresponding to each integer solution visited in the search process.
然后从信赖域子问题的角度出发，对无约束优化问题提出了一个改进的非单调信赖域算法。
We discuss non-monotonic trust region algorithm for unconstrained nonlinear optimization problems in view of Trust Region Model mainly.
资源发现问题由资源描述、资源信息组织、资源请求处理以及资源选择这四个子问题组成。
A resource discovery service is composed of resource description, re-source information organization, resource request processing and resource selection.
资源发现问题由资源描述、资源信息组织、资源请求处理以及资源选择这四个子问题组成。
A resource discovery service is composed of resource description, re-source information organization, resource request processing and resource selection.
应用推荐