mirage

Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Subject "On-line Algorithms"

DSpace/Manakin Repository

Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Subject "On-line Algorithms"

Sort by: Order: Results:

  • Laboratoire de l'informatique du parallélisme; Kenyon, Claire (1995-09)
    (eng) Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is known to behave better both in the worst case (when Best-fit has performance ratio 1.7) and in the average uniform case, ...
  • Laboratoire de l'informatique du parallélisme; Kenyon, Claire; Rabani, Yuval; Sinclair, Alistair (1995-09)
    (eng) We study of the average case performance of the Best Fit algorithm for on-line bin packing under the distribution in which the item sizes are uniformly distributed in the discrete range{1/k,2/k,...,j/k}. Our main ...

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share