Sciweavers

436 search results - page 44 / 88
» Ant algorithms and stigmergy
Sort
View
GPEM
2002
163views more  GPEM 2002»
15 years 5 months ago
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often sh...
Daniel Merkle, Martin Middendorf
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
15 years 11 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan
GECCO
2008
Springer
182views Optimization» more  GECCO 2008»
15 years 7 months ago
Scaling ant colony optimization with hierarchical reinforcement learning partitioning
This paper merges hierarchical reinforcement learning (HRL) with ant colony optimization (ACO) to produce a HRL ACO algorithm capable of generating solutions for large domains. Th...
Erik J. Dries, Gilbert L. Peterson
ICUMT
2009
15 years 3 months ago
A COP for cooperation in a P2P streaming protocol
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
María Elisa Bertinat, Darío Padula, ...
NI
2011
168views more  NI 2011»
14 years 9 months ago
Automated Reconstruction of Dendritic and Axonal Trees by Global Optimization with Geometric Priors
We present a novel probabilistic approach to fully automated delineation of tree structures in noisy 2D images and 3D image stacks. Unlike earlier methods that rely mostly on local...
Engin Türetken, Germán González...