Sciweavers

8 search results - page 1 / 2
» Average Case Analysis of Bounded Space Bin Packing Algorithm...
Sort
View
SODA
1998
ACM
159views Algorithms» more  SODA 1998»
13 years 6 months ago
Average-Case Analyses of First Fit and Random Fit Bin Packing
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
Susanne Albers, Michael Mitzenmacher
DAM
2008
81views more  DAM 2008»
13 years 5 months ago
Random-order bin packing
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
Edward G. Coffman Jr., János Csirik, Lajos ...
ESA
2009
Springer
142views Algorithms» more  ESA 2009»
13 years 12 months ago
An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
Andreas Karrenbauer, Thomas Rothvoß
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
13 years 10 months ago
Online Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Leah Epstein, Rob van Stee