110 search results - page 1 / 22 » Minimal Partitions Of A Box Into Boxes |
COMBINATORICA
2004
13 years 7 months ago
2004
DM
2007
13 years 7 months ago
2007
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
ICCAD
2000
IEEE
13 years 12 months ago
2000
IEEE
–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...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
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...
PODC
2010
ACM
13 years 11 months ago
2010
ACM
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...