Sciweavers

1484 search results - page 59 / 297
» Ants meeting algorithms
Sort
View
PG
2007
IEEE
14 years 4 months ago
Contour Correspondence via Ant Colony Optimization
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
Oliver van Kaick, Ghassan Hamarneh, Hao Zhang 0002...
ISDA
2005
IEEE
14 years 3 months ago
IDEAS: Intrusion Detection based on Emotional Ants for Sensors
Due to the wide deployment of sensor networks recently security in sensor networks has become a hot research topic. Popular ways to secure a sensor network are by including crypto...
Soumya Banerjee, Crina Grosan, Ajith Abraham
EUROGP
2001
Springer
14 years 2 months ago
A GP Artificial Ant for Image Processing: Preliminary Experiments with EASEA
This paper describes how animat-based “food foraging” techniques may be applied to the design of low-level image processing algorithms. First, we show how we implemented the fo...
Enzo Bolis, Christian Zerbi, Pierre Collet, Jean L...
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
ANTSW
2006
Springer
14 years 1 months ago
Higher Order Pheromone Models in Ant Colony Optimisation
Ant colony optimisation is a constructive metaheuristic that successively builds solutions from problem-specific components. A parameterised model known as pheromone--an analogue o...
James Montgomery