1484 search results - page 37 / 297 » Ants meeting algorithms |
CLEAR
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, the authors describe the UPC speaker identification system submitted to the CLEAR'07 (Classification of Events, Activities and Relationships) evaluation. Firstl...
CN
2007
13 years 10 months ago
2007
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
We present an incremental algorithm for building a neighborhood graph from a set of documents. This algorithm is based on a population of artificial agents that imitate the way re...
AUSAI
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
ISDA
2006
IEEE
14 years 4 months ago
2006
IEEE
We present in this paper a modification of Lumer and Faieta’s algorithm for data clustering. This algorithm discovers automatically clusters in numerical data without prior kno...