Sciweavers

206 search results - page 18 / 42
» Ant colony optimization and the minimum cut problem
Sort
View
ANTSW
2010
Springer
14 years 7 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 3 months ago
Self-adaptive ant colony optimisation applied to function allocation in vehicle networks
Modern vehicles possess an increasing number of software and hardware components that are integrated in electronic control units (ECUs). Finding an optimal allocation for all comp...
Manuel Förster, Bettina Bickel, Bernd Hardung...
ICANN
2009
Springer
15 years 2 months ago
A Two Stage Clustering Method Combining Self-Organizing Maps and Ant K-Means
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
Jefferson R. Souza, Teresa Bernarda Ludermir, Lean...
AUSAI
2004
Springer
15 years 3 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
CN
2007
148views more  CN 2007»
14 years 9 months ago
Using taxonomies for content-based routing with ants
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is known yet about its appropriateness for search i...
Elke Michlmayr, Arno Pany, Gerti Kappel