In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...
After an outline of the history of evolutionary algorithms, a new ( ) variant of the evolution strategies is introduced formally. Though not comprising all degrees of freedom, it i...
Many algorithms and data structures employing hashing have been analyzed under the uniform hashing assumption, i.e., the assumption that hash functions behave like truly random fu...
Evolutionary and genetic algorithms (EAs and GAs) are quite successful randomized function optimizers. This success is mainly based on the interaction of different operators like ...