Analysis of speedup in distributed algorithms
Analysis of speedup in distributed algorithms
The performance of cooperative processes
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
On the Efficiency of Parallel Backtracking
IEEE Transactions on Parallel and Distributed Systems
The use of parallelism to implement a heuristic search
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
A parallel searching scheme for multiprocessor systems and its application to combinatorial problems
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A cooperative hyper-heuristic search framework
Journal of Heuristics
Developing and evaluating a generic metamodel for MAS work products
Software Engineering for Multi-Agent Systems IV
Improving parallel local search for SAT
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Cooperative search for fair nurse rosters
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
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.