102 search results - page 4 / 21 » Hyper-heuristics for the dynamic variable ordering in constr... |
CSCLP
2004
Springer
14 years 24 days ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
IJCAI
1989
13 years 8 months ago
1989
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
CONSTRAINTS
2010
13 years 7 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
AAAI
2006
13 years 8 months ago
2006
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...