The power of ants in solving Distributed Constraint Satisfaction Problems
Authors:
- Samaneh Hoseini SemnaniSSSamaneh Hoseini Semnani
- Kamran ZamanifarKZKamran Zamanifar
- 1 February 2012
- journal article
- Published by Elsevier in Applied Soft Computing
- Vol. 12 (2) , 640-651
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- When Ants Attack: Ant Algorithms for Constraint Satisfaction ProblemsArtificial Intelligence Review, 2005
- Sensor networks and distributed CSP: communication, computation and complexityArtificial Intelligence, 2005
- The distributed breakout algorithmsArtificial Intelligence, 2004
- Ants can solve constraint satisfaction problemsIEEE Transactions on Evolutionary Computation, 2002
- Frozen development in graph coloringTheoretical Computer Science, 2001
- – Ant SystemFuture Generation Computer Systems, 2000
- Ant colonies for the quadratic assignment problemJournal of the Operational Research Society, 1999
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Ants can colour graphsJournal of the Operational Research Society, 1997
- Distributed constrained heuristic searchIEEE Transactions on Systems, Man, and Cybernetics, 1991