computing rule

computing rule的基本解释

-

[计] 计算尺, 计算法则

与computing rule相关的网络例句 [注：此内容来源于网络，仅供参考]

The topics are divided into three parts: the first part introduced the basic concepts of algorithms, mathematical algorithms and algorithms based on complexity analysis scheduling problem for the second part of the problem and plans to discuss a variety of existing algorithms, and describes the design of commonly used algorithms including sub-rule law, greedy method, dynamic programming, backtracking and branch and bound method, and describes the complexity of the calculation, as well as NP-complete problem the third part of the model on parallel computing and parallel algorithm design techniques.

全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。

Lastly,we present an algorithm to isolate real roots of a univariate spline, i.e., computing asequence of disjoint intervals such that each of them contains exactly one real root of agiven spline function, which is primarily based on the use of Descartes\' rule of signs withits B-spline coefficients and de Casteljau algorithm of B?

最后，基于B-样条系数的Descartes符号准则和Bézier曲线的de Casteljau算法，我们给出了一元样条实根分离算法，也就是计算出一列不相交区间，使得每个区间恰好只包含此样条函数的一个实根。

Lastly,we present an algorithm to isolate real roots of a univariate spline, i.e., computing asequence of disjoint intervals such that each of them contains exactly one real root of agiven spline function, which is primarily based on the use of Descartes rule of signs withits B-spline coefficients and de Casteljau algorithm of Bzier curve.

最后，基于B-样条系数的Descartes符号准则和Bézier曲线的de Casteljau算法，我们给出了一元样条实根分离算法，也就是计算出一列不相交区间，使得每个区间恰好只包含此样条函数的一个实根。