2) divide-and-conquer algorithm
分治算法
1.
Firstly, an efficient algorithm based on divide-and-conquer algorithm is proposed.
提出一种基于分治算法的Gray码生成方法,同时对算法的时间和空间复杂性进行了分析和讨论。
2.
Furthermore,for the subsystems coupled weakly with the others,in terms of the coupling characteristics among subsystems,a divide-and-conquer algorithm is also proposed to divide the system into the smaller subsystems.
此外,针对松散耦合子系统,提出了子系统分治算法。
3) partition algorithms
分治算法
1.
Facing to these problems,the paper brings forward a good idea that carry out un-recursion algorithms depending on partition algorithms.
针对使用分治算法时递归算法也容易同时应用在设计之中,给程序带来了运行效率较低,耗时多并大量占用存储空间等一系列问题,面对这些问题,提出在分治算法的基础上实现非递归,实现在计算机处理某些比较复杂的问题时,减少某些程序的反复执行,节约空间和减少时间复杂度,提高程序效率。
2.
The process was divided into 3 steps: firstly,all unorganized points were carved up into many small regions by partition algorithms and the topological structure of the whole points set was predigested by this step;secondly,direct triangulations were carried out in these small regions according to the d.
此方法将整个剖分过程分为三个步骤:首先借鉴分治算法的思想将整个点集进行区域划分,以降低其拓扑结构的复杂性;之后在各个小区域内依据异侧准则、法向量夹角最大准则、域值距离准则和最小内角最大准则进行直接三角剖分;最后根据三维Delaunay空球准则进行各区域边界的连接,从而完成剖分。
4) divide algorithm
分治算法
1.
In order to optimize the algorithm and improve the efficiency of calculating experiment variation,this paper introduces divide algorithm of experiment.
结果比较分治算法与常规算法的计算次数,提出实验变差函数分治算法,得出常规算法与分治算法计算量的倍数关系式。
2.
In this paper,analyse the existed algorithms and put forward the method to make use of divide algorithm to realize plane scattered data triangulation.
文中在分析已有算法的基础上,提出利用分治算法实现平面散乱点三角剖分。
5) divide and conquer
分治算法
1.
The algorithm "divide and conquer" is one of the frequently used method.
分治算法是程序设计中常用算法之一,是用划分子问题的方法,由较小尺寸的问题的可解导致原问题的解决,介绍了分治算法的两种形式,分析和探讨了它们的不同思路、不同特点和适用场合。
补充资料：分治
1.分别治理。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条