97 search results - page 14 / 20 » Algorithms for Distributed Constraint Satisfaction: A Review |
CP
2004
Springer
14 years 11 days ago
2004
Springer
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
CSCLP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
CP
2006
Springer
14 years 11 days ago
2006
Springer
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
CP
1998
Springer
14 years 26 days ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...