155 search results - page 1 / 31 » A Comparison Between ACO Algorithms for the Set Covering Pro... |
ANTSW
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
ADMA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Practical pattern classification and knowledge discovery problems require selecting a useful subset of features from a much larger set to represent the patterns to be cl...
COR
2006
13 years 5 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
ASIAN
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...
HM
2005
Springer
13 years 10 months ago
2005
Springer
We present a shared memory approach to the parallelization of the Ant Colony Optimization (ACO) metaheuristic and a performance comparison with an existing message passing implemen...