The experiment data are got by temperature experiment to validate the practicability and superiority of the best approximations algorithm 为了验证最佳一致逼近算法的优越性和实用性,做了温度实验测出补偿温度电压值。
A successive approximation algorithm of designing optimal disturbances rejection controllers is developed with respect to quadratic performance indexes 关于二次型性能指标给出了一种设计最优扰动抑制控制律的逐次逼近方法。
In practical calculating results , comparing with the method of least squares , the compensation precision can be improved about 10 % when using the best approximations algorithm 通过多组实验数据的理论计算结果的比较可以看出,由最佳一致逼近算法求取的精度比最小二乘法求取的精度要高10 %左右。
In chapterl , we introduce basic concepts about scheduling , the worst - case ratio analysis of approximation algorithms , stochastic scheduling problem and classes of stochastic scheduling policies 我们在第一章中首先介绍排序问题的基本概念，排序算法的性能分析，以及随机性排序问题及其排序策略。
Secondly , based on nurbs curves approximation algorithm , a nurbs surface approximation algorithm on discrete data sets is given . thirdly , a shape - preserving parametric surface interpolation to data set is given 2基于所给的nurbs曲线的逼近算法，建立了带插值条件的离散点集的nurbs曲面的逼近算法。
Up to now , most of the known upper bounds are asymptotic , and there is no polynomial approximation algorithm except , cor planar graphs which have a 2 - approximation algorithm 由于该问题的难度较大，近年来许多学者致力于研究其多项式可解的情形及上下界的确定。遗憾的是，到目前为止，仍未发现有效算法。
For the total tardiness scheduling with precedence constraints , an approximation algorithm with polynomial complexity was presented by transplanting the backward - shift algorithm of the case without precedence constraints 摘要把工件之间不带前后约束的延误排序的后移算法移植到带有前后约束的情况，提出一个多项式时间的近似算法。
We prove that the worst - case ratio of algorithm d is 15 / 13 , which is better than any other approximation algorithm except polynomial time approximation scheme considering with both worst - case ratio and time complexity 我们证明了对三台机情形，算法d的最坏情况界为15 13 ，该算法的最坏情况界和时间复杂性优于除近似方案以外的已有近似算法。
It is important to find a precise and fast algorithm for solar radiative transfer in the atmosphere . in this paper , we present , based on stamnes " s discrete - ordinate - method , an analytical four - stream approximation algorithm 我们在knutstamnes的离散纵标法( 1988 )的基础之上，提出了一种辐射传输四流近似计算方法，并且该算法可以得到一个解析解。
In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems 在第二章至第五章中，我们分别研究了四个组合优化问题的近似算法，并给出了它们的性能分析。
