372 search results - page 47 / 75 » The box mover problem |
CONCUR
2004
Springer
14 years 3 months ago
2004
Springer
Systems (extended abstract) Simona Orzan and Tim A.C. Willemse Department of Mathematics and Computer Science, Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, T...
QSIC
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
JGO
2010
13 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
CLEAR
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. This paper presents a novel approach to the problem of determining head pose estimation and face 3D orientation of several people in low resolution sequences from multipl...
ESA
2003
Springer
14 years 3 months ago
2003
Springer
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...