Conference proceeding
Constant Cost of the Computation-Unit in Efficiency Graphs for DCOP Solvers
Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, v 2, pp 380-384
09 Dec 2008
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.
Metrics
3 Record Views
1 citations in Scopus
Details
- Title
- Constant Cost of the Computation-Unit in Efficiency Graphs for DCOP Solvers
- Creators
- Marius Silaghi - Florida Institute of TechnologyRobert Lass - Drexel UniversityEvan Sultanik - Drexel UniversityWilliam Regli - Drexel UniversityToshihiro Matsui - Nagoya Institute of TechnologyMakoto Yokoo - Kyushu University
- Publication Details
- Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, v 2, pp 380-384
- Series
- WI-IAT '08
- Publisher
- IEEE Computer Society
- Resource Type
- Conference proceeding
- Language
- English
- Scopus ID
- 2-s2.0-62949137187
- Other Identifier
- 991019346807704721