Sciweavers

110 search results - page 1 / 22
» Minimal Partitions Of A Box Into Boxes
Sort
View
COMBINATORICA
2004
67views more  COMBINATORICA 2004»
13 years 10 months ago
Minimal Partitions Of A Box Into Boxes
Jaroslaw Grytczuk, Andrzej P. Kisielewicz, Krzyszt...
DM
2007
63views more  DM 2007»
13 years 10 months ago
On Sloane's generalization of non-squashing stacks of boxes
Recently, Sloane and Sellers solved a certain box stacking problem related to non– squashing partitions. These are defined as partitions n = p1 + p2 + · · · + pk with
George E. Andrews, James A. Sellers
ICCAD
2000
IEEE
109views Hardware» more  ICCAD 2000»
14 years 3 months ago
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
Hongbing Fan, Jiping Liu, Yu-Liang Wu
COMPGEOM
2004
ACM
14 years 4 months ago
Binary space partitions of orthogonal subdivisions
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
John Hershberger, Subhash Suri, Csaba D. Tó...
PODC
2010
ACM
14 years 2 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,...