大家在查： heat resisting Gagosian 尹喻东北三 contextualize winnowed +- HEAT- plastic films 森特·威尔纳

子问题

n.subproblem
网络subproblems; problem decomposition; overlap problem

子问题

英-汉网络释义

子问题

subproblem

石油英语词汇(S7)--石油百科 ... subpressure 低异常压力 subproblem 子问题 subprofessional 专业人员助手 ...

subproblems

子问题（Subproblems）话语切分（Speech segmentation）在多数的口语中，语音表示连续的字母互相结合在一起，因此模 …

problem decomposition

...过程 Step1:理清问题将复杂问题分解成简单的子问题(problem decomposition) -功能分解适合技术型产品，如汽车、航天器 - …

overlap problem

它将问题重新组合成子问题（overlap problem）。为了避免多 { i++; temp0=a[i];

leaf nodes

　转换成许多专业的子问题(团﹕leaf nodes)﹐　要证明　这些“团”的组合位阶等於“结”的“团结”所形成的“等同问题”　是等同於　“本”位阶 …

subquestion

...中心问题（ central question）及子问题（subquestion）。

例句：

In many practical problems it is proved that the coefficient of time complexity can be improved by balancing the size of the subproblem .

在很多具体问题上可证明子问题平衡对时问复杂性的常系数可以有改进。

Shape optimization for bracket is studied, by means of the Random Designs and the Sub -problem method by ANSYS Software .

利用通用有限元程序 ANSYS ，采用随即搜索法与子问题法对整体式肘板形状优化设计。

Previously , we thought a problem in term of time , but now , we think a whole problem made up of many parallelizable son problems.

以前我们考虑问题是按时间的顺序来考虑，而现在我们却要把整个问题看作由多个可并行的子问题组成。

Texture clustering is considered as a compound of two questions: feature measurement and clustering.

纹理聚类可以看作由两个子问题组成，即特征提取和分类处理。

Redefine the answer in terms of a simpler sub-problem.

使用更简单的子问题重新定义答案。

The optimization algorithm for the relaxed subproblem is constructed by virtue of the optimality function and the convergence is proved.

利用最优性函数构造了松弛子问题的优化算法，并证明了算法的收敛性。

The whole problem is transformed into a combination of projected subproblems , and problem solving in this space is more efficient .

原有的完整问题被转换成多个子问题的组合，在这维度降低的空间中求解将更有效率。

Then , the problem was solved by particle swarm optimization algorithm (PSO) after elimination of the constraint equations.

然后针对分解后的子问题，利用微粒群优化算法（PSO ）求解。

Module testing (or unit testing) is a process of testing the individual subprograms , subroutines , or procedures in a program .

模块测试，或者说是单元测试，是单独测试子问题，子程序以及程序进程的一个流程。

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 method can be used to solve more large-scale optimization problems because the sub-problem solved in the algorithm is simple .

该方法能用于求解较大规模的优化问题，是因为它处理的子问题比较简单。

The problem here is solved by a predictor - corrector primal-dual log-barrier(PCPDLB) method as a sequence of linearized sub-problem.

在算法上选用逐次线性化优化方法，并对每一个线性化子问题采用新算法 ——预测校正原始对偶对数障碍内点法求解。

Dealing with inductively-defined data sets , however , makes finding the sub-problem considerably easier .

不过，使用归纳定义的（inductively-defined ）数据集可以令子问题的获得更为简单。

"Legal legitimacy " issue is sub-issue of Habermas' legitimacy theory .

“法律的合法性 ”问题属于哈贝马斯合法性理论中的子问题。

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 .

下面三个值分别对应着我在前面列出的三个递归子问题返回的值。

A scatter search approach is developed to solve cell scheduling sub-problem.

同时采用分散搜索算法求解单元调度子问题。

In each example you'll somehow compare two sequences , and you'll use a two-dimensional table to store the solutions to subproblems.

在每个示例中，都会比较两个序列，而且将使用二维表格存储子问题的解。

The convergence theorem of the proposed method is proved based on the exact solution of the subproblem .

基于子问题的精确求解，该文证明了算法的收敛性。

All the subproblems, with are strongly monotone VIP and have a common structure , can be treated by one subroutine .

方法中的子问题均是强单调变分不等式问题且具有相同的结构，可以用同一号程序进行处理。

In the map step , the document is taken by the master node and the problem is divided into subproblems.

在 Map 步骤中，由主节点接收文档并将问题划分为多个子问题。

The first one is based on pre-selecting wavelength idea, it restricts route problem by resource and improves wavelength utilizations rate.

第一种是从预选波长角度出发，通过对路由子问题进行约束，提高波长使用率；

To avoid the solving of the same linear programming model in searching , a tabu list is used .

在搜索中，为了避免相同序列的子问题模型的求解，采用了禁忌表。

But because the sorting of the subproblems can be done in parallel, it parallelizes better than quick-sort .

但是因为子问题的排序能够并行完成，所以合并排序的并行性比快速排序好。

On the dispatch of emergency resources , there are also two sub-problems.

在资源调度方面，也研究了两个子问题。

子问题

子问题