divide and conquer algorithm的例句大全

Divide and Conquer Algorithm on the Calendar Problems of the Round Robin

赛程问题分治算法

Study and Applications of divide and conquer algorithm in spatial overlay analysis

空间叠加分析中的分而治之算法研究与应用

Based on the object oriented data structure of Voronoi diagram for normal curvilinear polygon, an improved Divide and Conquer algorithm is presented in this paper for Voronoi diagram generation called Main Chain Divide and Conquer algorithm.

基于一般曲线多边形Voronoi图的面向对象数据结构，提出了一种改进的Voronoi图生成算法&基链分治算法。

and that's because that is a version of a divide and conquer algorithm.

这个想法非常重要，因为这就是分而治之算法的一个版本。

An Extended Divide and Conquer Algorithm for Solving Real Symmetric Band Generalized Eigenvalue Problem

求解对称带状广义特征值问题的扩展分治算法

Research on Selection Problem Divide and Conquer Algorithm

基于分治算法的选择问题研究

but in the case that the algorithms fail to find the optimum solution, the divide and conquer algorithm is more accurate.

但在找不到最优解的情况下，最大互关联算法更精确。

This paper presents a new divide and conquer algorithm for the eigenvalue problem of symmetric tridiagonal matrices.

关于对称三对角矩阵特征值问题，本文提出一种新的分治算法。

As recollected and analysed some classical arithmetic, I ameliorate point by point insertion algorithm and make it unite with divide and conquer delaunay triangulation algorithm, which is become a compositive algorithm which has excellence of constructing rapidly and using small space.

在回顾和分析以往的经典算法的基础上，改进了逐点插入算法并同分治算法相结合形成了一种具有建网快，耗费空间小的合成算法。

In this paper, an algorithm for fast constructing Delaunay triangulation is presented. This algorithm takes the advantages of incremental insertion algorithm and divide conquer, and has the advantages of high efficiency and small space.

研究一种快速构建Delaunay三角网的算法，该算法结合逐点插入算法和分治算法，具有建网速度快、耗费空间小的优点。

They are null space parallel algorithm, Greville parallel algorithm and divide and conquer parallel algorithm.

它们是零空间并行方法，Greville并行算法和分而治之并行算法。

A improved MASK algorithm by using divide and conquer strategy

基于分治策略的MASK算法的改进

multi-population co-evolutionary algorithm based on the 'divide and conquer' principle

一类基于分治原理的多种群协同进化算法

the algorithm of finding pair of three-dimensional points with the minimum distance by means of divide and conquer

分治法实现最接近点对问题的三维推广算法

our algorithm employs the divide and conquer strategy, bisection and secant's iteration.

该算法以二分法、割线法迭代为基础，采用分而治之策略。