Sciweavers

224 search results - page 23 / 45
» Quick-and-dirty ant colony optimization
Sort
View
TEC
2002
163views more  TEC 2002»
13 years 7 months ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
SYNASC
2005
IEEE
133views Algorithms» more  SYNASC 2005»
14 years 1 months ago
Emotional Ant Based Modeling of Crowd Dynamics
It is known that one of the most disastrous forms of collective human behavior is the kind of crowd stampede induced by panic. This situation often leads to fatalities as people a...
Soumya Banerjee, Crina Grosan, Ajith Abraham
PPSN
2004
Springer
14 years 26 days ago
AntHocNet: An Ant-Based Hybrid Routing Algorithm for Mobile Ad Hoc Networks
In this paper we present AntHocNet, a new algorithm for routing in mobile ad hoc networks. Due to the ever changing topology and limited bandwidth it is very hard to establish and ...
Gianni Di Caro, Frederick Ducatelle, Luca Maria Ga...
ANTSW
2004
Springer
14 years 28 days ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...