bin packing 中文意思是什麼

bin packing 解釋
裝箱問題
  • bin : n 1 (放五穀、煤炭等的)有蓋大箱。2 〈英國〉收采酒花的帆布袋。3 (地下室)葡萄酒貯藏庫。4 垃圾箱...
  • packing : n 1 包裝,打包,打行李,包紮;包裝材料,包裝用品;包裝法。2 (縫隙)填料〈舊棉絮等〉。3 〈美國〉...
  1. In chapter 3, two novel scheduling algorithms are put forward to supporting qos according to bin packing problem. bhps arriving are sent to different queues according to their outport, in each ourport queue, bhps are classified by their priorities and scheduled as a batch. the simulation results shows that ffd and bfd not only can provide qos effectively, but also can improve the average loss function

    通過該調度演算法,可以實現高優先級突發對低優先級的搶占,提供服務質量支持,並利用openet模擬軟體對這兩種調度演算法進行模擬。模擬結果表明,基於裝箱問題的ffd和bfd調度演算法不僅能提供有效的qos支持,還能改善系統總體的丟失性能。
  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 。
  3. An example demonstrates the feasibility of this method. we also study the design of mean selection based on the minimum loss using taguchi. g method, present the concepts of the ratio of quality loss and effective off - center. at last we explore the design of mean selection based on the maximum profit in the process of bin packing and improve the old model

    應用田口的質量損失理論,我們研究了基於損失最小的過程均值設計問題,提出了質量損失率及過程有效偏移的概念;然後以裝罐過程為例,探討了基於利潤最大化的過程均值設計,並改進了原有的裝罐模型。
  4. The inheritance algorithm of a kind of chromosomes with changeable length to solve the bin - packing problem

    求解裝箱問題的一種變長度染色體遺傳演算法
  5. On - line algorithms for the constrained bin packing problem

    一類帶約束的裝箱問題的在線演算法
  6. The bin packing problem belongs to the most complicated calculated problem : npc problem ( nondeterminstic polynomial complete )

    裝箱問題是具有最高計算復雜性的一類問題: npc ( nondeterministicpolynomialcomplete非確定型多項式演算法)類問題。
  7. A variation of one - dimensional bin packing problem : the minimum cardinality bin covering problem is described and it is a huristic algorithm is designed

    摘要文章介紹一維裝箱問題的一個衍生問題:最小基數箱子覆蓋問題和它的一個啟發式演算法。
  8. 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 。
分享友人