1484 search results - page 24 / 297 » Ants meeting algorithms |
ASAP
2006
IEEE
13 years 9 months ago
2006
IEEE
In this paper, a routing model for minimizing hot spots in the network on chip (NOC) is presented. The model makes use of AntNet routing algorithm which is based on Ant colony. Us...
CIDM
2009
IEEE
13 years 11 months ago
2009
IEEE
Most real-world classification problems involve continuous (real-valued) attributes, as well as, nominal (discrete) attributes. The majority of Ant Colony Optimisation (ACO) classi...
ANTSW
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Mobile ad hoc networks are a class of highly dynamic networks. In previous work, we developed a new routing algorithm, called AntHocNet, for these challenging network env...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper deals with transport user equilibrium. A modified version of the ant colony system is proposed where the ant colony heuristic is adapted in order to take into account a...