419 search results - page 11 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
IAT
2008
IEEE
14 years 2 months ago
2008
IEEE
The reason for using distributed constraint satisfaction algorithms is often to allow agents to find a solution while revealing as little as possible about their variables and co...
IJCAI
1989
13 years 9 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
STACS
2007
Springer
14 years 2 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
CP
1995
Springer
13 years 12 months ago
1995
Springer
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...