405 search results - page 21 / 81 » On the Complexity of Global Constraint Satisfaction |
CP
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. Although constraint programming offers a wealth of strong, generalpurpose methods, in practice a complex, real application demands a person who selects, combines, and ref...
VLSID
2003
IEEE
15 years 11 months ago
2003
IEEE
A formal synthesis method for complex real-time embedded software is proposed in this work. Compared to previous work, our method not only synthesizes embedded software with compl...
100
click to vote
ICRA
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— We incorporate sampling-based global path planning with Visual Servoing (VS) for a robotic arm equipped with an in-hand camera. The path planning accounts for a number ...
172
click to vote
CP
2009
Springer
15 years 11 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
AGI
2008
15 years 14 days ago
2008
Whereas symbol