Sciweavers

361 search results - page 62 / 73
» Ant Colony Optimization
Sort
View
ANTSW
2004
Springer
14 years 3 months ago
An Ant Approach to Membership Overlay Design
Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership a...
Vittorio Maniezzo, Marco A. Boschetti, Márk...
AE
2005
Springer
14 years 3 months ago
An Exponential Representation in the API Algorithm for Hidden Markov Models Training
In this paper, we show how an efficient ant based algorithm, called API and initially designed to perform real parameter optimization, can be adapted to the difficult problem of Hi...
Sebastien Aupetit, Nicolas Monmarché, Moham...
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
14 years 2 months ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
14 years 3 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
2006
Springer
179views Optimization» more  GECCO 2006»
14 years 1 months ago
Parisian evolution with honeybees for three-dimensional reconstruction
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
Gustavo Olague, Cesar Puente