An Empirical Study of Distributed Constraint Satisfaction Algorithms
Many real world problems are naturally distributed, whether they are spatially, cognitively, or otherwise. Distributed problems naturally lend themselves to solutions using multi-agent paradigms. Distributed Constraint Satisfaction Problems (DisCSPs) are a class of such distributed problems. In DisC...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10214/3038 |