32 search results - page 6 / 7 » Geometric constraint solving via C-tree decomposition |
CP
2004
Springer
14 years 25 days ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
ICRA
2007
IEEE
14 years 1 months ago
2007
IEEE
— This paper addresses the problem of restoring standing in paralegia via functional electrical stimulation (FES) and investigates the relashionship between body posture and volu...
ICRA
2002
IEEE
14 years 11 days ago
2002
IEEE
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
TSP
2011
13 years 2 months ago
2011
—This paper deals with the problem of estimating the steering direction of a signal, embedded in Gaussian disturbance, under a general quadratic inequality constraint, representi...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
A good distance metric is crucial for unsupervised learning from high-dimensional data. To learn a metric without any constraint or class label information, most unsupervised metr...