worst case method 中文意思是什麼
worst case method
解釋
最壞情況法-
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 。 -
So, as the worst case when the computation cost of the objective function is negligible, the improvement is strictly increasing with respect to n and tends to + oc approximately at a rate lnn / ln2 when n - + oo. the results also show that the im - provement of cf - pcg algorithin with ad over newton method with ad is much greater than the improvement of cf - pcg algorithm witll sd over newton method with sd
本文也對不同的微分方法下牛頓- pcg演算法與牛頓法的效率比進行了比較，得出：在一般的假設下，使用自動微分下的效率比嚴格大於使用符號微分下的效率比，而且它們的比值隨問題維數n趨于無窮，即應用自動微分的牛頓- pcg演算法對牛頓法有進一步的改進。 -
The initial strain must be the optimum value obtained by multiple - trial method. 5. in the static analysis of the bridge model under live load, assuming a shifting concentrated load on the girder, analyzing the relation map of each section deflection and the location of the concentrated load, finishing the load - on of the worst - case live load, then the moment and deflection envelope diagrams of the girder were obtained
成橋模型建立后，在後續活載作用下的靜力分析必須首先在主樑上作用移動集中荷載，分析主梁各斷面的活載撓度與集中荷載作用位置關系曲線圖，完成最不利活載的加載，從而最後得到懸索橋主梁的彎矩包絡圖及撓度包絡圖。
分享友人