Sciweavers

1310 search results - page 130 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
WOB
2003
140views Bioinformatics» more  WOB 2003»
14 years 11 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
AUSAI
2004
Springer
15 years 3 months ago
Ant Colonies Discover Knight's Tours
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
Philip Hingston, Graham Kendall
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
14 years 10 months ago
Parallelizing Feature Selection
Classification is a key problem in machine learning/data mining. Algorithms for classification have the ability to predict the class of a new instance after having been trained on...
Jerffeson Teixeira de Souza, Stan Matwin, Nathalie...
GECCO
2008
Springer
183views Optimization» more  GECCO 2008»
14 years 11 months ago
UMDAs for dynamic optimization problems
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
Carlos M. Fernandes, Cláudio F. Lima, Agost...
IFSA
2003
Springer
179views Fuzzy Logic» more  IFSA 2003»
15 years 3 months ago
A CHC Evolutionary Algorithm for 3D Image Registration
Image registration has been a very active research area in the computer vision community. In the last few years, there is an increasing interest on the application of Evolutionary ...
Oscar Cordón, Sergio Damas, Jose Santamar&i...