Sciweavers

4524 search results - page 2 / 905
» The Complexity of Global Constraints
Sort
View
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
13 years 10 months ago
On the Complexity of Global Constraint Satisfaction
Cristina Bazgan, Marek Karpinski
ICRA
2009
IEEE
165views Robotics» more  ICRA 2009»
13 years 12 months ago
Global path planning for robust Visual Servoing in complex environments
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 ...
Moslem Kazemi, Kamal K. Gupta, Mehran Mehrandezh
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 5 months ago
Decomposition of the NVALUE constraint
We study decompositions of the global NVALUE constraint. Our main contribution is theoretical: we show that there are propagators for global constraints like NVALUE which decomposi...
Christian Bessiere, George Katsirelos, Nina Narody...
CP
2008
Springer
13 years 7 months ago
A Soft Constraint of Equality: Complexity and Approximability
We introduce the SoftAllEqual global constraint, which maximizes the number of equalities holding between pairs of assignments to a set of variables. We study the computational com...
Emmanuel Hebrard, Barry O'Sullivan, Igor Razgon
CPAIOR
2004
Springer
13 years 10 months ago
Cost Evaluation of Soft Global Constraints
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
Nicolas Beldiceanu, Thierry Petit