Characterizing Performance of Consistency Algorithms by Algorithm Configuration of Random CSP Generators

Daniel J. Geschwender, Robert J. Woodward, Berthe Y. Choueiry

AAAI 2015 pp. 4162-4163

doi:10.1609/AAAI.V29I1.9728 /aaai/2015/geschwender2015aaai-characterizing/

Abstract

In Constraint Processing, many algorithms for enforcing the same level of local consistency may exist. The performance of those algorithms varies widely. In order to understand what problem features lead to better performance of one algorithm over another, we utilize an algorithm configurator to tune the parameters of a random problem generator and maximize the performance difference of two consistency algorithms for enforcing constraint minimality. Our approach allowed us to generate instances that run 1000 times faster for one algorithm over the other.

PDF AAAI Semantic Scholar

Cite

Text

Geschwender et al. "Characterizing Performance of Consistency Algorithms by Algorithm Configuration of Random CSP Generators." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9728

Markdown

[Geschwender et al. "Characterizing Performance of Consistency Algorithms by Algorithm Configuration of Random CSP Generators." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/geschwender2015aaai-characterizing/) doi:10.1609/AAAI.V29I1.9728

BibTeX

@inproceedings{geschwender2015aaai-characterizing,
  title     = {{Characterizing Performance of Consistency Algorithms by Algorithm Configuration of Random CSP Generators}},
  author    = {Geschwender, Daniel J. and Woodward, Robert J. and Choueiry, Berthe Y.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {4162-4163},
  doi       = {10.1609/AAAI.V29I1.9728},
  url       = {https://mlanthology.org/aaai/2015/geschwender2015aaai-characterizing/}
}