• No results found

Results for online dynamic bin packing algorithms

Online dynamic bin packing

Online dynamic bin packing

... 1.1.3 Online Algorithms and Competitive Analysis Optimization problems in which the input is received one at a time and output must be produced throughout time are called online ...problems, ...

116

Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing

Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing

... many results (Epstein and van Stee 2005a , 2007 ; Ferreira et ...space online square packing, Epstein and van Stee ( 2007 ) gave a ...hypercube packing, an O(d/ log d)-competitive algorithm ...

15

Online Bin Packing with Advice

Online Bin Packing with Advice

... In this paper, we study the advice complexity of the online bin packing problem. Our interest in studying the problem under this setting is mostly theoretical. Nevertheless, in many practical ...

13

Dynamic multi-dimensional bin packing

Dynamic multi-dimensional bin packing

... d-dimensional dynamic cube packing online algorithm has an asymptotic competitive ratio of at least ...any online algorithm eventually uses at least 2F − 1 ...one bin, therefore the ...

17

Fully Dynamic Bin Packing Revisited

Fully Dynamic Bin Packing Revisited

... fully dynamic bin packing problem, where items arrive and depart in an online fashion and repacking of previously packed items is ...new dynamic rounding technique and new ideas to ...

17

New Results on the Probabilistic Analysis of Online Bin Packing and its Variants

New Results on the Probabilistic Analysis of Online Bin Packing and its Variants

... classical bin packing problem arise in cloud computing, when we have to store virtual machines on ...the bin packing problem is one of the fundamental problems in theoretical computer science: ...

123

Streaming algorithms for bin packing and vector scheduling

Streaming algorithms for bin packing and vector scheduling

... our algorithms proceed by adopting and extending known polynomial-time approximation schemes for the off- line versions of the problems, while in other cases, we come up with new ...main results show that ...

21

Cloud Storage and Online Bin Packing

Cloud Storage and Online Bin Packing

... simplest online bin packing algo- rithms: Next Fit, First Fit, and Best ...these algorithms is r NextFit = 2, while the r FirstFit and r FirstFit are both ...space online algorithm in ...

6

Asymptotic results for the Generalized Bin Packing Problem

Asymptotic results for the Generalized Bin Packing Problem

... arriving online are not directly packed into bins but are placed into a ...semi-online algorithms named First Fit with Buffer and Rejections (FFBR) and Best Fit with Buffer and Rejections ...open ...

10

Asymptotic results for the Generalized Bin Packing Problem

Asymptotic results for the Generalized Bin Packing Problem

... arriving online are not directly packed into bins but are placed into a ...semi-online algorithms named First Fit with Buffer and Rejections (FFBR) and Best Fit with Buffer and Rejections ...open ...

10

Hybrid algorithms for the variable sized bin packing problem

Hybrid algorithms for the variable sized bin packing problem

... computational results for Set2 are presented in Table ...the results of LBH( L 0 ) and BS( L 0 ...of bin types as well as to the increase in the number of ...

15

Online Bin Packing with Advice of Small Size

Online Bin Packing with Advice of Small Size

... the online bin packing ...the online algorithm is supplemented with some additional information concerning the ...of online algorithms for this ...any online algorithm ...

12

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

... of algorithms. In particular, consider the standard bin packing problem, in which one is given a bin capacity b and a list of items L = (a 1 , a 2 , ...a packing of these items into a ...

14

Bin packing algorithms for virtual machine placement in cloud computing: a review

Bin packing algorithms for virtual machine placement in cloud computing: a review

... 6. PERFORMANCE EVALUATION In this section, the simulation analysis results for analyzing the relative performance of different VMP algorithms are presented. The simulation was carried out through open ...

13

A tensor analysis improved genetic algorithm for online bin packing

A tensor analysis improved genetic algorithm for online bin packing

... an online bin packing problem. Online bin packing policies with matrix representation enables construction of a 3 rd - order tensor as the high quality candidate solutions vary ...

8

Adaptive Resource Provisioning for the Cloud Using Online Bin Packing

Adaptive Resource Provisioning for the Cloud Using Online Bin Packing

... Using Online Bin Packing Weijia Song, Zhen Xiao, Senior Member, IEEE, Qi Chen, and Haipeng Luo Abstract—Data center applications present significant opportunities for multiplexing server ...on-line ...

14

On First Fit Bin Packing for Online Cloud Server Allocation

On First Fit Bin Packing for Online Cloud Server Allocation

... the Dynamic Bin Packing (DBP) problem known as MinUsageTime ...Fit packing algorithm for the MinUsageTime DBP problem, and establish a new upper bound of µ + 4 on the competitive ratio of ...

10

Genetic Algorithm With Random Crossover and Dynamic Mutation on Bin Packing Problem

Genetic Algorithm With Random Crossover and Dynamic Mutation on Bin Packing Problem

... Genetic Algorithms produce individuals who represent ...maximum results because it is trapped in a local search and a case of premature ...best results obtained are not comprehensive, so it is ...

6

On-Line Sequential Bin Packing

On-Line Sequential Bin Packing

... on-line bin packing problem that achieves a cumulative loss (measured as the sum of the total wasted capacity and lost items) that is less than the total loss of the best strategy in the class (determined ...

21

CHAMP: Creating Heuristics via Many Parameters for online bin packing

CHAMP: Creating Heuristics via Many Parameters for online bin packing

... of online bin-packing ...the results are based on a particular neighbourhood (which depends mainly on the solution representation), as well as the move operators ...

44

Show all 10000 documents...

Related subjects