Approximations in distributed optimization

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

Volumn 3709 LNCS, Issue , 2005, Pages 802-806

  Petcu, Adrian ^a   Faltings, Boi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; OPTIMIZATION; PARAMETER ESTIMATION; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; CONSTRAINT GRAPH; MINIBUCKET ELIMINATION SCHEME;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33646188367     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_68     Document Type: Conference Paper

References (4)

1. Rina Dechter. Bucket elimination: A unifying framework for processing hard and soft constraints. Constraints: An International Journal, 7(2):51-55, 1997.
2. Roger Mailler and Victor Lesser. Solving distributed constraint optimization problems using cooperative mediation. Proceedings of Third International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2004), 2004.
3. P. J. Modi, W. M. Shen, and M. Tambe. An asynchronous complete method for distributed constraint optimization. In Proc. AAMAS, 2003.
4. Adrian Petcu and Boi Faltings. A scalable method for multiagent constraint optimization. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, IJCAI-05, Edinburgh, Scotland, Aug 2005.