26 search results - page 2 / 6 » Decomposition During Search for Propagation-Based Constraint... |
IJCAI
2007
13 years 7 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...
IJCAI
2001
13 years 6 months ago
2001
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
IROS
2006
IEEE
13 years 11 months ago
2006
IEEE
— This article introduces a new technique for planning reactionless paths to a point in Cartesian space, for manipulators mounted on a free-floating satellite. It is based on de...
CSCLP
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
ICTAI
2010
IEEE
13 years 3 months ago
2010
IEEE
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...