Distributed CSPs: Why it is assumed a variable per agent?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4612 LNAI, Issue , 2007, Pages 407-408

  Salido, Miguel A ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Distributed constraint satisfaction problems

Indexed keywords

AUTOMATIC PROGRAMMING; CONSTRAINT THEORY; LARGE SCALE SYSTEMS; PROBLEM SOLVING; REAL TIME SYSTEMS;

DISTRIBUTED CONSTRAINT SATISFACTION PROBLEM (DISCSP); MULTIPLE AUTOMATED AGENTS; REAL DISTRIBUTED PROBLEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34548087923     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73580-9_38     Document Type: Conference Paper

References (5)

1. Bacchus, F., van Beek, P.: On the conversion between non-binary and binary constraint satisfaction problems. In: proceeding of AAAI-98, pp. 311-318 (1998)
2. Bessiére, C., Belaissaoui, M., Ezzahir, R., Bouyakhf, El-H.: Dischoco: A platform for distributed constraint programming. In: Proceedings of IJCAI-07 Workshop on Distributed Constraint Reasoning (2007)
3. Faltings, B., Yokoo, M.: Introduction: Special issue on distributed constraint satisfaction. Artificial Intelligence 161, 1-5 (2005)
4. Salido, M.A., Barber, F.: Distributed CSPs by graph partitioning. Applied Mathematics and Computation 183, 491-498 (2006)
5. Yokoo, M., Hirayama, K.: Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems 3, 185-207 (2000)