2109 search results - page 180 / 422 » Solving Necklace Constraint Problems |
204
click to vote
IJCNN
2006
IEEE
16 years 15 days ago
2006
IEEE
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
147
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— This paper presents a decentralized planning method for generating dynamic whole body motions of multilink robots including humanoids. First, a robotic system will be modeled a...
167
click to vote
IJCAI
2007
15 years 8 months ago
2007
Caching, symmetries, and search with decomposition are powerful techniques for pruning the search space of constraint problems. In this paper we present an innovative way of effi...
212
click to vote
CP
2005
Springer
16 years 32 min ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
192
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
It has been shown that the 3D shape of a deformable surface in an image can be recovered by establishing correspondences between that image and a reference one in which the shape ...