Sciweavers

224 search results - page 32 / 45
» Quick-and-dirty ant colony optimization
Sort
View
FLAIRS
2006
13 years 9 months ago
Which Dynamic Constraint Problems Can Be Solved By Ants?
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
Koenraad Mertens, Tom Holvoet, Yolande Berbers
LSSC
2005
Springer
14 years 1 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
IWSOS
2009
Springer
14 years 2 months ago
Laying Pheromone Trails for Balanced and Dependable Component Mappings
This paper presents an optimization framework for finding efficient deployment mappings of replicated service components (to nodes), while accounting for multiple services simult...
Máté J. Csorba, Hein Meling, Poul E....
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
14 years 1 months ago
Exposing origin-seeking bias in PSO
We discuss testing methods for exposing origin-seeking bias in PSO motion algorithms. The strategy of resizing the initialization space, proposed by Gehlhaar and Fogel and made po...
Christopher K. Monson, Kevin D. Seppi
CEC
2007
IEEE
14 years 1 months ago
Computational chemotaxis in ants and bacteria over dynamic environments
— Chemotaxis can be defined as an innate behavioural response by an organism to a directional stimulus, in which bacteria, and other single-cell or multicellular organisms direct...
Vitorino Ramos, Carlos Fernandes, Agostinho C. Ros...