Proceedings

Distributed Constraint Optimization Problems Related with Soft Arc Consistency

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 2812-2812.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-478

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.

Patricia Gutierrez, and Pedro Meseguer. 2011. Distributed Constraint Optimization Problems Related with Soft Arc Consistency. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 2812–2812. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-478
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards