Solving the really hard problems with cooperative search
Tad Hogg, Colin P. Williams · National Conference on Artificial Intelligence · 1993
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.