Sciweavers

436 search results - page 41 / 88
» Ant algorithms and stigmergy
Sort
View
AUSAI
2004
Springer
16 years 4 days ago
Ant Colonies Discover Knight's Tours
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 ...
Philip Hingston, Graham Kendall
ISDA
2006
IEEE
16 years 22 days ago
Finding Groups in Data: Cluster Analysis with Ants
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...
Urszula Boryczka
EUC
2004
Springer
16 years 3 days ago
Dynamic Routing and Wavelength Assignment in WDM Networks with Ant-Based Agents
In this paper, we propose an ant-based algorithm for dynamic routing and wavelength assignment (RWA) in WDM optical networks under the wavelength continuity constraint. By adopting...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi, Mi...
ATAL
2007
Springer
16 years 27 days ago
Convergence and rate of convergence of a simple ant model
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
Amine M. Boumaza, Bruno Scherrer
CCIA
2005
Springer
15 years 8 months ago
Multi-Objective Multicast Routing based on Ant Colony Optimization
This work presents a new multiobjective algorithm based on ant colonies, which is used in the construction of the multicast tree for data transmission in a computer network. The pr...
Diego Pinto, Benjamín Barán, Ram&oac...