ML Anthology

Distributed Constraint Optimization Problems Related with Soft Arc Consistency

Patricia Gutierrez, Pedro Meseguer
IJCAI 2011 pp. 2812-2813
doi:10.5591/978-1-57735-516-8/IJCAI11-478 /ijcai/2011/gutierrez2011ijcai-distributed/

Abstract

Distributed Constraint Optimization Problems (DCOPs) can be optimally solved by distributed search algorithms, such as ADOPT and BnB-ADOPT. In centralized solving, maintaining soft arc consistency during search has proved to be beneficial for performance. In this thesis we aim to explore the maintenance of different levels of soft arc consistency in distributed search when solving DCOPs.

PDF IJCAI Semantic Scholar

Cite

Text

Gutierrez and Meseguer. "Distributed Constraint Optimization Problems Related with Soft Arc Consistency." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-478

Markdown

[Gutierrez and Meseguer. "Distributed Constraint Optimization Problems Related with Soft Arc Consistency." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/gutierrez2011ijcai-distributed/) doi:10.5591/978-1-57735-516-8/IJCAI11-478

BibTeX

@inproceedings{gutierrez2011ijcai-distributed,
  title     = {{Distributed Constraint Optimization Problems Related with Soft Arc Consistency}},
  author    = {Gutierrez, Patricia and Meseguer, Pedro},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {2812-2813},
  doi       = {10.5591/978-1-57735-516-8/IJCAI11-478},
  url       = {https://mlanthology.org/ijcai/2011/gutierrez2011ijcai-distributed/}
}