go top

divide and conquer algorithm

• 分治算法

网络释义专业释义英英释义

分治算法

2、 分治算法 ( divide-and-conquer algorithm ) 也可以称之分解算法，该算法就是将一个大问题分解成许多小问题，然后单独 处理这些小问题，最终将结果结合起来形成对整个问题的...

• 分治算法 - 引用次数：4

Good linear speedup and stable efficiency can be achieved under distributed-memory environments. ii) A divide-and-conquer algorithm /with new dividing strategy is proposed.

同时，算法也具有良好的内在并行性，当n→∞时，加速比Sp→p，在分布式环境下可以获得很好的线性加速比和稳定的效率。 （2）关于实对称带状矩阵广义特征值问题 ⅰ) 提出了一种结合多分法的并行分治算法，给出了特征值分割定理及其证明。

参考来源 - 分布式存储环境下矩阵广义特征值问题的并行计算

·2,447,543篇论文数据，部分数据来源于NoteExpress

Divide and conquer algorithm

• abstract: In computer science, divide and conquer (D&C) is an important algorithm design paradigm based on multi-branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same (or related) type, until these become simple enough to be solved directly.

双语例句

• If this can be done, then the divide-and-conquer algorithm is a good choice.

如果可以这么做那么分治算法是个好的选择

• A typical parallel divide-and-conquer algorithm takes the form shown in Listing 1.

典型并行divide - and - conquer算法形式如清单1

• A really nice algorithm. As I said, an example of divide and conquer.

真的很好的算法就如

\$firstVoiceSent
- 来自原声例句