895 search results - page 52 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
96
Voted
PR
1998
14 years 10 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
88
Voted
GECCO
2010
Springer
15 years 3 months ago
2010
Springer
This paper argues that multiagent learning is a potential “killer application” for generative and developmental systems (GDS) because key challenges in learning to coordinate ...
89
Voted
GECCO
2009
Springer
15 years 3 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
86
Voted
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
78
Voted
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...