6456 search results - page 388 / 1292 » Constraint Solving on Terms |
179
click to vote
EOR
2007
15 years 6 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
182
Voted
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
113
click to vote
AUTOMATICA
1999
15 years 6 months ago
1999
The square-root information filter and smoother algorithms have been generalized to handle singular state transition matrices and perfect measurements. This has been done to allow...
160
click to vote
PAMI
2007
15 years 6 months ago
2007
This paper introduces a novel approach for solving the problem of camera calibration from spheres. By exploiting the relationship between the dual images of spheres and the dual i...
190
click to vote
FOCM
2010
15 years 5 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...