Sciweavers

155 search results - page 1 / 31
» A Comparison Between ACO Algorithms for the Set Covering Pro...
Sort
View
ANTSW
2004
Springer
14 years 27 days ago
A Comparison Between ACO Algorithms for the Set Covering Problem
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 ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
ADMA
2006
Springer
172views Data Mining» more  ADMA 2006»
14 years 1 months ago
Experimental Comparison of Feature Subset Selection Using GA and ACO Algorithm
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...
Keunjoon Lee, Jinu Joo, Jihoon Yang, Vasant Honava...
COR
2006
122views more  COR 2006»
13 years 7 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
13 years 11 months ago
Ant Colony Optimization for the Ship Berthing Problem
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. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim
HM
2005
Springer
97views Optimization» more  HM 2005»
14 years 1 months ago
Comparing Parallelization of an ACO: Message Passing vs. Shared Memory
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...
Pierre Delisle, Marc Gravel, Michaël Krajecki...