372 search results - page 10 / 75 » The box mover problem |
COMPGEOM
2000
ACM
15 years 4 months ago
2000
ACM
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
FATES
2005
Springer
15 years 5 months ago
2005
Springer
The global testing problem studied in this paper is to seek a definite answer to whether a system of concurrent black-boxes has an observable behavior in a given finite (but cou...
113
click to vote
COMGEO
2011
ACM
14 years 6 months ago
2011
ACM
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multiparameter problems. Specifically,...
SAC
2010
ACM
15 years 5 months ago
2010
ACM
The canonical algorithm to enforce box consistency over a constraint relies on a dichotomic process to isolate the leftmost and rightmost solutions. We identify some weaknesses of...