1484 search results - page 30 / 297 » Ants meeting algorithms |
EVOW
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. This paper proposes a novel Ant Colony Optimisation algorithm for the hierarchical problem of predicting protein functions using the Gene Ontology (GO). The GO structure ...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
ADHOC
2008
13 years 10 months ago
2008
This paper shows a novel self-organizing approach for routing datagrams in ad hoc networks, called Distributed Ant Routing (DAR). This approach belongs to the class of routing alg...
CEC
2009
IEEE
14 years 4 months ago
2009
IEEE
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
CEC
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper we show how an ant colony optimisation algorithm may be used to enumerate knight’s tours for variously sized chessboards. We have used the algorithm to enumerate al...