approximation algorithm造句
例句與造句
- 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
由于該問(wèn)題的難度較大，近年來(lái)許多學(xué)者致力于研究其多項(xiàng)式可解的情形及上下界的確定。遺憾的是，到目前為止，仍未發(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
摘要把工件之間不帶前后約束的延誤排序的后移算法移植到帶有前后約束的情況，提出一個(gè)多項(xiàng)式時(shí)間的近似算法。 - 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
我們證明了對(duì)三臺(tái)機(jī)情形，算法d的最壞情況界為15 13 ，該算法的最壞情況界和時(shí)間復(fù)雜性優(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
我們?cè)趉nutstamnes的離散縱標(biāo)法( 1988 )的基礎(chǔ)之上，提出了一種輻射傳輸四流近似計(jì)算方法，并且該算法可以得到一個(gè)解析解。 - 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
在第二章至第五章中，我們分別研究了四個(gè)組合優(yōu)化問(wèn)題的近似算法，并給出了它們的性能分析。 - It's difficult to find approximation algorithm in a sentence. 用approximation algorithm造句挺難的
- In order to meet the need of flexibility in the logistics network planning , the network constructing algorithm based on the idea of dynamic programming and the approximation algorithm for the shortest path search based on the dynamic programming are also proposed as the basis of above mentioned algorithms
為了滿足物流網(wǎng)絡(luò)規(guī)劃的敏捷性要求，作為以上算法的基礎(chǔ)，還提出了基于動(dòng)態(tài)規(guī)劃思想的網(wǎng)絡(luò)圖構(gòu)建算法和基于動(dòng)態(tài)規(guī)劃思想的最短路搜索的近似算法。 - The best approximations algorithm is just the method which can solve the mini - max solution of the least value of frequency deviation . because of the reason above , in this paper the best approximations algorithm is introduced into calculating the parameters of atcxo compensation network for the first time
最佳一致逼近算法正是能夠求解出使頻率偏差的絕對(duì)值最小的極小極大解的一種方法,為此將最佳一致逼近算法首次應(yīng)用于模擬溫補(bǔ)晶振補(bǔ)償網(wǎng)絡(luò)參數(shù)的計(jì)算中。 - The nurbs curves and surfaces approximation to constrained data sets is discussed in this dissertation . the major works are as follows : firstly , based on simulated annealing algorithm and least square principle , a nurbs curves approximation algorithm to constrained discrete data sets is presented
本文討論了帶約束的離散點(diǎn)集的nurbs曲線、曲面的逼近問(wèn)題，主要工作如下： 1基于模擬退火算法和最小二乘法，給出了帶插值條件的離散點(diǎn)集的nurbs曲線逼近的算法。 - Users of the preliminary edition ( now out of print ) will be interested to note several new chapters on complexity theory : chapter 8 on space complexity ; chapter 9 on provable intractability , and chapter 10 on advanced topics , including approximation algorithms , alternation , interactive proof systems , cryptography , and parallel computing
早期版本的讀者將驚奇的發(fā)現(xiàn)新增的有關(guān)復(fù)雜性理論的章節(jié)：第8章，空間復(fù)雜性；第9章，不可證明性；第10章，高級(jí)話題，包括近似算法，交替，交互推理系統(tǒng)，密碼學(xué)和并行計(jì)算。 - After giving the legendre polynomials approximation to parametric speed of the curve , the author gives the jacobi polynomials approximation to parametric speed with endpoints interpolation . from this , two algebraic offset approximation algorithms , which preserve the direction of normal , are derived
給出了曲線參數(shù)速度的legendre多項(xiàng)式逼近，進(jìn)一步給出了參數(shù)速度的插值區(qū)間端點(diǎn)的jacobi多項(xiàng)式逼近，由此導(dǎo)出了保持法矢平移方向的兩個(gè)等距代數(shù)有理逼近算法 - The parametric speed of the curve is firstly approximated by the bezier polynomial which takes the lengths of control polygon ' s edges of the direction curve of normal as bezier coordinates . then the corresponding geometric offset approximation algorithm is given . moreover , an offset approximation with high precision is obtained by degree elevation of the direction curve of normal
首先利用以法矢方向曲線的控制多邊形邊長(zhǎng)為b zier縱標(biāo)的b zier多項(xiàng)式來(lái)逼近曲線的參數(shù)速度，給出了相應(yīng)的幾何等距逼近算法，進(jìn)一步結(jié)合法矢方向曲線的升階獲得了高精度逼近 - In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems , one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio , another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan , we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1 . 6
第一個(gè)算法利用裝箱問(wèn)題中的ff ( firstfit )算法求解極大化按期完工工件數(shù)的平行機(jī)排序問(wèn)題pm d _ j = d n - u _ j ，該近似算法具有漸近性能比下界。第二個(gè)近似算法利用二維裝箱中strippacking問(wèn)題的算法求解以極小化makespan為目標(biāo)的帶并行工件的平行機(jī)排序問(wèn)題，該算法的漸近性能比具有下界1 . 5和上界1 . 6 。 - In the theoretical calculation , the best approximations algorithm shows its practicability and superiority comparing with the method of least squares . in the practices production , the practicability of the best approximations algorithm can be shown . the frequency stability is about 1ppm in the temperature range : - 20 70 . the frequency stability
在實(shí)際生產(chǎn)中最佳一致逼近算法具有實(shí)用性,用該算法求取的電阻參數(shù)來(lái)裝配補(bǔ)償網(wǎng)絡(luò),在- 20 - 70窄溫度范圍內(nèi)atcxo的頻率穩(wěn)定度為: 1ppm左右; - 40 - 80寬得溫度范圍內(nèi)頻率溫度度在: 2 . 5ppm左右。 - Based on many references , a evaluating function is proposed with performance index of hall call waiting time ( hwt ) , people number in a car , energy consuming . the statistic approximation algorithm for hwt is introduced , based on the analysis of elevator traffic state , the calculation of traveling distance and stop number is explained in detail in the thesis . according to the characteristics of the elevator , a group of elevator teaching signals are constructed , by which the weight coefficients are trained according to the widrow - hoff rule
本文在借鑒了大量的文獻(xiàn)基礎(chǔ)上，提出以平均等候時(shí)間、轎廂人數(shù)、能源消耗為性能指標(biāo)的評(píng)價(jià)函數(shù)；詳細(xì)介紹了乘客待梯時(shí)間hwt的統(tǒng)計(jì)近似算法；基于對(duì)電梯交通狀況的分析，對(duì)停層次數(shù)和運(yùn)行距離這兩個(gè)重要參數(shù)的計(jì)算進(jìn)行了詳盡的介紹；依據(jù)電梯運(yùn)行特性參數(shù)，構(gòu)造一組電梯運(yùn)行教師信號(hào)，并采用神經(jīng)網(wǎng)絡(luò)的widrow - hoff學(xué)習(xí)規(guī)則訓(xùn)練權(quán)系數(shù)。 - This process is as follows : firstly , the data of different section contour and of section line have been obtained by reverse - engineering ; secondly , non - uniform b - spline approximation algorithm is used to fit the discrete data ; then the data have been optimized and reduced by adopting adaptive sampling of key points of the fitted curve based on vertical distance , sequently the adaptive sampling data is transformed into the format of the . ibl file of the famous 3 - d design software pro / e . therefore we reconstruct the surface and a model is generated ; lastly , the effectiveness of the adopted algorithm and modeling approach are demonstrated by the experiments
建模型的過(guò)程中，首先運(yùn)用逆向工程測(cè)量方法，獲得曲面物體上不同截面輪廓線的測(cè)量數(shù)據(jù)點(diǎn)列，接著對(duì)測(cè)量數(shù)據(jù)點(diǎn)進(jìn)行平滑處理，用最小二乘法求解基于數(shù)據(jù)點(diǎn)列的控制多邊形，以非均勻三次b樣條曲線擬合截面輪廓曲線；然后利用基于垂距的數(shù)據(jù)采樣算法，對(duì)擬合曲線上的數(shù)據(jù)點(diǎn)進(jìn)行重新采樣，達(dá)到優(yōu)化數(shù)據(jù)點(diǎn)的分布及減少描述曲線數(shù)據(jù)量的目的。