374 search results - page 12 / 75 » A Genetic Algorithm for the Index Selection Problem |
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...
ESWA
2007
14 years 9 months ago
2007
With the development of the web, large numbers of documents are available on the Internet. Digital libraries, news sources and inner data of companies surge more and more. Automat...
110
click to vote
ACRI
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. This paper presents the Anisotropic selection scheme for cellular Genetic Algorithms (cGA). This new scheme allows to enhance diversity and to control the selective press...
GECCO
2009
Springer
15 years 2 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...
166
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
A problem that is inherent to the development and efficient use of solvers is that of tuning parameters. The CP community has a long history of addressing this task automatically. ...