Sciweavers

33 search results - page 5 / 7
» FPGA implementation of population-based ant colony optimizat...
Sort
View
ANTSW
2006
Springer
15 years 1 months ago
An Analysis of the Different Components of the AntHocNet Routing Algorithm
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...
Frederick Ducatelle, Gianni Di Caro, Luca Maria Ga...
LSSC
2005
Springer
15 years 2 months ago
Ant Algorithm for Grid Scheduling Problem
Abstract. Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geog...
Stefka Fidanova, Mariya K. Durchova
70
Voted
COMPSAC
2004
IEEE
15 years 1 months ago
A Development Framework for Rapid Meta-Heuristics Hybridization
While meta-heuristics are effective for solving large-scale combinatorial optimization problems, they result from time-consuming trial-and-error algorithm design tailored to speci...
Hoong Chuin Lau, Wee Chong Wan, Min Kwang Lim, Ste...
GECCO
2006
Springer
210views Optimization» more  GECCO 2006»
15 years 1 months ago
Adaptive diversity in PSO
Spatial Extension PSO (SEPSO) and Attractive-Repulsive PSO (ARPSO) are methods for artificial injection of diversity into particle swarm optimizers that are intended to encourage ...
Christopher K. Monson, Kevin D. Seppi
JGO
2010
121views more  JGO 2010»
14 years 7 months ago
The oracle penalty method
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...
Martin Schlüter, Matthias Gerdts