Constant cost of the computation-unit in efficiency graphs for DCOP solvers

Marius C. Silaghi, Robert N. Lass, Evan A. Sultanik, William C. Regli, Toshihiro Matsui, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We show how to ensure a constant cost for the computation-unit in graphs depicting the number of (sequential) computation-units at different (distributed) problem sizes. We report empirical evaluation with ADOPT revealing that the computation cost associated with a constraint check (commonly used - and assumed constant - in ENCCCs evaluations) actually varies with the problem size, by orders of magnitude. We therefore propose better computationunits based on a basket of weighted constraint-checks and contexts processing operations.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008
Pages380-384
Number of pages5
DOIs
Publication statusPublished - Dec 1 2008
Event2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008 - Sydney, NSW, Australia
Duration: Dec 9 2008Dec 12 2008

Publication series

NameProceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008

Other

Other2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008
CountryAustralia
CitySydney, NSW
Period12/9/0812/12/08

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Software

Cite this

Silaghi, M. C., Lass, R. N., Sultanik, E. A., Regli, W. C., Matsui, T., & Yokoo, M. (2008). Constant cost of the computation-unit in efficiency graphs for DCOP solvers. In Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008 (pp. 380-384). [4740652] (Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008). https://doi.org/10.1109/WIIAT.2008.427