110 search results - page 1 / 22 » Minimal Partitions Of A Box Into Boxes |
112
Voted
COMBINATORICA
2004
15 years 5 months ago
2004
104
click to vote
DM
2007
15 years 5 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
150
click to vote
ICCAD
2000
IEEE
15 years 10 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...
123
click to vote
COMPGEOM
2004
ACM
15 years 11 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...
160
click to vote
PODC
2010
ACM
15 years 9 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...