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

  • Authors:
  • Marius C. Silaghi;Robert N. Lass;Evan A. Sultanik;William C. Regli;Toshihiro Matsui;Makoto Yokoo

  • Affiliations:
  • -;-;-;-;-;-

  • Venue:
  • WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.