11 search results - page 1 / 3 » Solving Finite Domain Constraint Hierarchies by Local Consis... |
CP
2003
Springer
13 years 10 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
AUSAI
2006
Springer
13 years 8 months ago
2006
Springer
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
EPIA
2001
Springer
13 years 9 months ago
2001
Springer
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution s...
AICOM
2004
13 years 4 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
FLAIRS
2004
13 years 6 months ago
2004
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...