160 search results - page 1 / 32 » Boosting Distributed Constraint Satisfaction |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
ANOR
2004
13 years 7 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
ICDCS
2000
IEEE
14 years 10 days 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 9 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 13 days 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...