8016 search results - page 278 / 1604 » On the practical genetic algorithms |
163
click to vote
WEA
2005
Springer
16 years 4 days ago
2005
Springer
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
183
click to vote
GECCO
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
173
click to vote
EUROGP
2003
Springer
15 years 12 months ago
2003
Springer
This paper discusses the underlying pressures responsible for code growth in genetic programming, and shows how an understanding of these pressures can be used to use to eliminate...
133
click to vote
ANTS
2006
Springer
15 years 10 months ago
2006
Springer
We propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr [1] as well as two even more effective generalizations. We report the empirical behav...
163
click to vote
BIOADIT
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...