@inproceedings{23509b2445664667b2b8d3b4280ff041,
title = "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 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.",
author = "Silaghi, {Marius C.} and Lass, {Robert N.} and Sultanik, {Evan A.} and Regli, {William C.} and Toshihiro Matsui and Makoto Yokoo",
year = "2008",
month = dec,
day = "1",
doi = "10.1109/WIIAT.2008.427",
language = "English",
isbn = "9780769534961",
series = "Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008",
pages = "380--384",
booktitle = "Proceedings - 2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008",
note = "2008 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT 2008 ; Conference date: 09-12-2008 Through 12-12-2008",
}