Abstract
Complex system simulations can often be represented by an evolving graph which evolves with a one-to-one mapping between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. We use competing colonies of numerical ants, each depositing distinctly colored pheromones, to find clusters of highly communicating entities. Ants are attracted by communications and their own colored pheromones, while repulsion interactions between colonies allow to preserve a good distribution. © 2004 Springer-Verlag.
Cite
CITATION STYLE
Bertelle, C., Dutot, A., Guinand, F., & Olivier, D. (2004). Colored ants for distributed simulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3172 LNCS, pp. 326–333). Springer Verlag. https://doi.org/10.1007/978-3-540-28646-2_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
