Sciweavers

372 search results - page 8 / 75
» The box mover problem
Sort
View
EOR
2007
78views more  EOR 2007»
13 years 7 months ago
A heuristic for the three-dimensional strip packing problem
The contribution presents a heuristic for the three-dimensional strip packing problem (3D-SPP) with rectangular pieces (boxes). The considered 3D-SPP can be formulated as follows:...
Andreas Bortfeldt, Daniel Mack
PODC
2010
ACM
13 years 11 months ago
Finding mobile data under delay constraints with searching costs
A token is hidden in one of several boxes and then the boxes are locked. The probability of placing the token in each of the boxes is known. A searcher is looking for the token by...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002,...
IV
2002
IEEE
88views Visualization» more  IV 2002»
14 years 8 days ago
Visualizing Spatially Varying Distribution Data
Box plot is a compact representation that encodes the minimum, maximum, mean, median, and quartile information of a distribution. In practice, a single box plot is drawn for each ...
David T. Kao, Alison Luo, Jennifer L. Dungan, Alex...
ENDM
2010
127views more  ENDM 2010»
13 years 7 months ago
MPQ-trees for orthogonal packing problem
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
Cédric Joncour, Arnaud Pêcher, Petru ...
SYNTHESE
2010
147views more  SYNTHESE 2010»
13 years 5 months ago
A resource-bounded agent addresses the newcomb problem
In the Newcomb problem, the standard arguments for taking either one box or both boxes adduce what seem to be relevant considerations, but they are not complete arguments, and att...
John L. Pollock