Sciweavers

234 search results - page 8 / 47
» The Complexity of Global Cardinality Constraints
Sort
View
AAAI
1994
14 years 11 months ago
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. Th...
Jean-Charles Régin
ER
1999
Springer
104views Database» more  ER 1999»
15 years 2 months ago
A Taxonomy of Recursive Relationships and Their Structural Validity in ER Modeling
Abstract. In this paper, we present the complete classification of recursive relationships and the criteria that contribute to the structural validity of modeling recursive relatio...
James Dullea, Il-Yeol Song
ICRA
2009
IEEE
165views Robotics» more  ICRA 2009»
15 years 4 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
CPAIOR
2006
Springer
15 years 1 months ago
Open Constraints in a Closed World
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
Willem Jan van Hoeve, Jean-Charles Régin
CP
2008
Springer
14 years 11 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