分治算法的基本思想是将一个规模为N的问题分解为K个规模较小的子问题,这些子问题相互独立且与原问题性质相同。求出子问题的解,就可得到原问题的解。即一种分目标完成程序算法,简单问题可用二分法完成。
...(山脊线、山谷线、陡坎等)的特点,提出了基于通用边交换(edge flip)约束Delaunay三角化的分治算法(divide-and-conquer algorithm),该算法效率高,对于任意复杂平面域的三角化都是稳健的.
基于54个网页-相关网页
随着逐渐深入的讨论,擒兽队的算法工程师们拿出了程序设计领域的经典算法,分治算法(divide and conquer)来解决问题。分治方法属于典型的抽象(abstraction)技术。
基于46个网页-相关网页
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
如果可以这么做,那么分治算法是个好的选择。
If this can be done, then the divide-and-conquer algorithm is a good choice.
分治算法是解决许多实际问题的重要而有效的方法。
The divide and conquer algorithm is an important and efficient method to many problems.
文中在分析已有算法的基础上,提出利用分治算法实现平面散乱点三角剖分。
In this paper, analyse the existed algorithms and put forward the method to make use of divide algorithm to realize plane scattered data triangulation.
And then the things I have to ask is how much of a division do I want to do?
如果可以这么做,那么分治算法是个好的选择,接下的问题就是我需要把问题分成多少份?
OK. Binary search is perhaps the simplest of the divide and conquer algorithms, and what does that mean? It says, in order to solve a problem, cut it down to a smaller problem and try and solve that one.
好了,二分搜索也许是,最简单的分治算法,这意味着什么?,也就是说,为了解决一个问题,把它切割成小的问题,然后再来一个个解决。
So things that are good candidates for divide And conquer are problems where it's easy to figure out how to divide down, and the combination is of little complexity.
因为适合用分治算法解决的问题,最好是能够简单的将问题进行分解,并且合并的过程不是非常的复杂,只要比线性方案要小。
应用推荐