Constant Cost of the Computation-Unit in Efficiency Graphs for DCOP Solvers

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 constraint check (commonly used -- and assumed constant -- in ENCCCs evaluations) actually varies with the problem size, by orders of magnitude. We therefore propose better computation-units based on a basket of weighted constraint-checks and contexts processing operations.

DOI: 10.1109/WIIAT.2008.427

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@article{Silaghi2008ConstantCO, title={Constant Cost of the Computation-Unit in Efficiency Graphs for DCOP Solvers}, author={Marius-Calin Silaghi and Robert N. Lass and Evan Sultanik and William C. Regli and Toshihiro Matsui and Makoto Yokoo}, journal={2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology}, year={2008}, volume={2}, pages={380-384} }