206 search results - page 5 / 42 » Distributed Partial Constraint Satisfaction Problem |
ICDCS
2000
IEEE
14 years 1 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
AAAI
2006
13 years 10 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
ATAL
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
JAR
2000
13 years 8 months ago
2000
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...