subproblems

美 　英

• 網(wǎng)絡子問題

例句

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

原有的完整問題被轉換成多個子問題的組合，在這維度降低的空間中求解將更有效率。

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

一個問題的最優(yōu)解能夠用原始問題的子問題的最優(yōu)解構造得到。

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

引言牛頓型方法是解變分不等式的一類重要數(shù)值迭代算法。

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

然后將這些子問題發(fā)布給工作節(jié)點，由它處理后再將結果返回給主節(jié)點。

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.

在每個示例中，都會比較兩個序列，而且將使用二維表格存儲子問題的解。

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

方法中的子問題均是強單調(diào)變分不等式問題且具有相同的結構，可以用同一號程序進行處理。

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

在Map步驟中，由主節(jié)點接收文檔并將問題劃分為多個子問題。

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

但是因為子問題的排序能夠并行完成，所以合并排序的并行性比快速排序好。

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

在可以使用遞歸，但因為遞歸重復解決相同的子問題造成效率低下的時候，則可以采用動態(tài)編程。

These two subproblems have important applications to numerical algebra, VLSI-layout and algorithm graph theory respectively;

這兩類子問題分別在數(shù)值代數(shù)、VLSI-設計和算法圖論等學科領域中有重要的應用。