39 search results - page 8 / 8 » On-line bin Packing with Two Item Sizes |
ESA
2009
Springer
14 years 10 days ago
2009
Springer
The study of hashing is closely related to the analysis of balls and bins; items are hashed to memory locations much as balls are thrown into bins. In particular, Azar et. al. [2] ...
ANOR
2010
13 years 5 months ago
2010
This paper presents two novel genetic algorithms (GAs) for hard industrially relevant packing problems. The design of both algorithms is inspired by aspects of molecular genetics,...
CEC
2007
IEEE
14 years 3 days ago
2007
IEEE
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
NETWORKS
2006
13 years 5 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...