分治法,divide and conquer英语短句,例句大全

分治法,divide and conquer
1)divide and conquer分治法
1.The Algorithm of Finding Pair of Three-Dimensional Points with the Minimum Distance by Means of Divide and Conquer;分治法实现最接近点对问题的三维推广算法
2.The name of technique is "divide and conquer".介绍了算法设计技术分治法的应用。
3.0 and was compared with divide and conquer.0的环境下实现了该算法,并将其与分治法所得的结果进行了比较。
2)divide-and-conquer分治法
1.Presents on non-numerical algorithm for solving 2-dimensional linear programming problems with its basic idea in divide-and-conquer.提出了一种求解二维线性规划问题的非数值算法，其基本思想是采用分治法，依据直线的斜率及在ｘ和ｙ轴上的截距将约束条件分成不同的类，删去多余的约束条件，从而达到简化计算的目的。
3)divide-and-conquer method分治法
1.A fast algorithm of multiple-precision multiplication based on divide-and-conquer method;一个基于分治法的快速多精度乘法
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.文中在分析已有算法的基础上,提出利用分治算法实现平面散乱点三角剖分。

英文短句/例句

1.Architecture and Implementation of Multiplier Suitable for ECC Based on Divided Algorithm基于分治算法的ECC乘法器结构及实现
2.Sub-rule Algorithm Timetable Application in Large-scale School分治算法在大规模学校排课中的应用
3.We introduce a new algorithm for subset sum problem.介绍了求解子集和问题的一个分治算法。
4.The Research of Divide and Conquer Algorithms for Skew-symmetric Tridiagonal Eigenvalue Problems;求反对称三对角矩阵特征值问题的分治算法研究
5.A Divide and Conquer Algorithm combining Support Vector Machine and Nearest Neighbor Principle结合SVM和KNN实现求解大规模复杂问题的分治算法
6.isolation method分间隔离治疗法;分离法;分离计算法;隔离法
7.Quicksort Algorithm Based on the Theory of Division-and-Conquer and Recursion;基于分治与递归策略的快速排序算法
8.A improved MASK algorithm by using divide and conquer strategy基于分治策略的MASK算法的改进
9.Study and Applications of divide and conquer algorithm in spatial overlay analysis空间叠加分析中的分而治之算法研究与应用
10.Research on Algorithm for Course Scheduling System Based on Dividing-Conquering and Greedy基于分治和贪心相结合的排课算法研究
11.The Study on Calculation models and Optimization of Dose Distribution Brachytherapy;近距离治疗中剂量分布的计算模型与优化算法研究
12.Dose Distribution Calculation fo ~(192)Ir in Brachytherapy using Monte Carlo Method用蒙特卡罗积分方法计算近距离治疗源~(192)Ir的剂量角度分布
13.Positive Analysis and Calculating Method on Gini Coefficient--such as Inner Mongolia;基尼系数的计算方法与实证分析——以内蒙古自治区为例
14.Review of Budget Mechanism:Analysis from Economics,Politics, Law,Finance and Decision,;预算机制论:从经济、政治、法律、财政、决策角度的分析
15.Hybrid algorithm based on cultural algorithm and modified differential evolution algorithm基于文化算法和改进差分进化算法的混合算法
16.Operator Selection and Computational Efficiency Analysis on Genetic Algorithm选择算子与遗传算法的计算效率分析
17.psychoanalytic therapy精神分析治疗法精神分析治疗法
18.Estimationg of the Implementing Costs of "Infectious Disease Control Act;《传染病防治法》执法活动成本测算研究

相关短句/例句

divide-and-conquer分治法
1.Presents on non-numerical algorithm for solving 2-dimensional linear programming problems with its basic idea in divide-and-conquer.提出了一种求解二维线性规划问题的非数值算法，其基本思想是采用分治法，依据直线的斜率及在ｘ和ｙ轴上的截距将约束条件分成不同的类，删去多余的约束条件，从而达到简化计算的目的。
3)divide-and-conquer method分治法
1.A fast algorithm of multiple-precision multiplication based on divide-and-conquer method;一个基于分治法的快速多精度乘法
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 algorithm分治算法
6)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空球准则进行各区域边界的连接,从而完成剖分。