1542 search results - page 3 / 309 » Kernelization of packing problems |
CP
2010
Springer
13 years 6 months ago
2010
Springer
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
WAOA
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We consider two- and three-dimensional bin packing problems where 90◦ rotations are allowed. We improve all known asymptotic performance bounds for these problems. In p...
AAAI
2012
11 years 10 months ago
2012
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...
DCG
2008
13 years 7 months ago
2008
We construct a dense packing of regular tetrahedra, with packing density D > .7786157. Keywords Crystallography
ESA
2004
Springer
13 years 11 months ago
2004
Springer
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...