worst-case bound 中文意思是什麼
worst-case bound
解釋
最壞情況界線-
Algorithm bls has a worst - case guarantee no more than 1 + b, the bound indicates that it becomes very poor in extreme cases where b is algorithm blpt provides worst case error bound 3
演算法bls和演算法bedd得到一個性能指標為1 + b 。貪婪演算法qrlpt給出原問題的一個最差性能比為3 。 -
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 。 -
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 。
分享友人