subproblems

网络子问题

网络释义

1.	子问题子问题（Subproblems）话语切分（Speech segmentation）在多数的口语中，语音表示连续的字母互相结合在一起，因此模 … wenku.baidu.com\|基于8个网页

例句

释义:

全部全部,子问题子问题

类别:全部全部,口语口语,书面语书面语,标题标题,技术技术

来源:全部全部,字典字典,网络网络

难度:全部全部,简单简单,中等中等,难难

更多例句筛选

收起例句筛选

1.

2.

An optimal solution to the problem could be constructed from optimal solutions to subproblems of the original problem .

一个问题的最优解能够用原始问题的子问题的最优解构造得到。

3.

We establish a quasi-Newton algorithm for solving a class of variational inequality problems which subproblems are linear equations.

引言牛顿型方法是解变分不等式的一类重要数值迭代算法。

www.dictall.com

4.

These subproblems are then distributed to worker nodes , which solve the problem and return the results to the master node .

然后将这些子问题发布给工作节点，由它处理后再将结果返回给主节点。

5.

6.

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

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

7.

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

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

8.

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

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

9.

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

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

10.

Dynamic programming is used when recursion could be used but would be inefficient because it would repeatedly solve the same subproblems.

在可以使用递归，但因为递归重复解决相同的子问题造成效率低下的时候，则可以采用动态编程。

1
2