asymptotic bound 中文意思是什麼
asymptotic bound
解釋
漸近界- asymptotic : 漸近的
- bound : n 〈pl 〉1 界限，界線，限度。2 邊界，邊境；邊界線內的領土。3 區域，領域，范圍。vt 1 限，限制。2 ...
-
In this paper, we study an on - line version of the two - dimensional bin packing problem that is the problem of packing a list of rectangular items into a minimum number of unit - square bins in an on - line manner. an on - line algorithm called rtdh ( refined two dimensional harmonic ) is proposed and analyzed. we show that rtdh can achieve an asymptotic worst - case ratio of less than 2. 7687, which beats the best - known bound 2. 85958
目前，對該問題的研究有各種演算法，主要有harmonic和round演算法，本文針對harmonic和round演算法存在的問題，提出一種演算法rtdh （ refinedtwodimensionalharmonic ） ，做了相應的分析，並且給出了該演算法的最壞性能比是2 . 7687的證明，這個結果刷新了目前最好的結果2 . 85958 。 -
5. a multivariable process identification based on asymptotic black - box theory is studied. firstly, a high - order mimo arx model and its frequency error bound is estimated from identification data and low - order siso models is obtained from high - order mimo arx model
作者對一種基於漸近黑箱理論的多變量過程辨識方法進行了研究：首先用高階arx模型估計模型參數，並給出高階模型的頻域均方誤差；然後，對高階arx模型進行降階處理。 -
Since in many situations the error term is not normally distributed, it is important to know the asymptotic properties ( large sample properties ), i. e., the properties of ols estimator and test statistics when the sample size grows without bound
由於在很多情形下誤差項可能呈現非正態分佈，了解ols估計量和檢驗統計量的漸近性，即當樣本容量任意大時的特性就是重要的問題。 -
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
第一個演算法利用裝箱問題中的ff （ firstfit ）演算法求解極大化按期完工工件數的平行機排序問題pm d _ j = d n - u _ j ，該近似演算法具有漸近性能比下界。第二個近似演算法利用二維裝箱中strippacking問題的演算法求解以極小化makespan為目標的帶并行工件的平行機排序問題，該演算法的漸近性能比具有下界1 . 5和上界1 . 6 。
分享友人