477 search results - page 2 / 96 » Argumentation as distributed constraint satisfaction: applic... |
ATAL
2003
Springer
13 years 10 months ago
2003
Springer
ICDCS
2000
IEEE
13 years 9 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...
ICCD
2007
IEEE
14 years 2 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
AAAI
2006
13 years 6 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
13 years 9 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...