ML Anthology

Solving the Really Hard Problems with Cooperative Search

Tad Hogg, Colin P. Williams
AAAI 1993 pp. 231-236
/aaai/1993/hogg1993aaai-solving/

Abstract

We present and experimentally evaluate the hypothesis that cooperative parallel search is well suited for hard graph coloring problems near a previously identified transition between under- and overconstrained instances. We find that simple cooperative methods can often solve such problems faster than the same number of independent agents.

PDF AAAI Semantic Scholar

Cite

Text

Hogg and Williams. "Solving the Really Hard Problems with Cooperative Search." AAAI Conference on Artificial Intelligence, 1993.

Markdown

[Hogg and Williams. "Solving the Really Hard Problems with Cooperative Search." AAAI Conference on Artificial Intelligence, 1993.](https://mlanthology.org/aaai/1993/hogg1993aaai-solving/)

BibTeX

@inproceedings{hogg1993aaai-solving,
  title     = {{Solving the Really Hard Problems with Cooperative Search}},
  author    = {Hogg, Tad and Williams, Colin P.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1993},
  pages     = {231-236},
  url       = {https://mlanthology.org/aaai/1993/hogg1993aaai-solving/}
}