215 search results - page 8 / 43 » Online Bin Coloring |
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
This paper studies the dynamic bin packing problem, in which items arrive and depart at arbitrary time. We want to pack a sequence of unit fractions items (i.e., items with sizes ...
COLT
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolut...
119
click to vote
ROBOCUP
2007
Springer
15 years 5 months ago
2007
Springer
In this article we present an automatic on-line color calibration system that makes extensive use of the spatial relationships between color classes in the color space. First, we i...
105
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
ALGORITHMICA
2010
14 years 12 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...