The experiment data are got by temperature experiment to validate the practicability and superiority of the best approximations algorithm 為了驗證最佳一致逼近算法的優(yōu)越性和實用性,做了溫度實驗測出補償溫度電壓值。
A successive approximation algorithm of designing optimal disturbances rejection controllers is developed with respect to quadratic performance indexes 關于二次型性能指標給出了一種設計最優(yōu)擾動抑制控制律的逐次逼近方法。
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 通過多組實驗數(shù)據(jù)的理論計算結果的比較可以看出,由最佳一致逼近算法求取的精度比最小二乘法求取的精度要高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 由于該問題的難度較大,近年來許多學者致力于研究其多項式可解的情形及上下界的確定。遺憾的是,到目前為止,仍未發(fā)現(xiàn)有效算法。
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 ,該算法的最壞情況界和時間復雜性優(yōu)于除近似方案以外的已有近似算法。
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 在第二章至第五章中,我們分別研究了四個組合優(yōu)化問題的近似算法,并給出了它們的性能分析。
In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems. Approximation algorithms are often associated with NP-hard problems; since it is unlikely that there can ever be efficient polynomial-time exact algorithms solving NP-hard problems, one settles for polynomial-time sub-optimal solutions.