Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
Edda Happ, Daniel Johannsen, Christian Klein, Fran...
With the ever expanding Web and the information published on it, effective tools for managing such data and presenting information to users based on their needs are becoming nece...
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Modularity and symmetry are two properties observed in almost every engineering and biological structure. The origin of these properties in nature is still unknown. Yet, as engine...
This paper aims to identify the missing links from theory of Genetic Algorithms (GAs) to application of GAs. Categories and Subject Descriptors: J.0 [Computer Applications]: Gener...
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
In this paper we explore the model–building issue of multiobjective optimization estimation of distribution algorithms. We argue that model–building has some characteristics t...
The Differential Evolution algorithm uses an elitist selection, constantly pushing the population in a strict downhill search, in an attempt to guarantee the conservation of the ...
Michael G. Epitropakis, Vassilis P. Plagianakos, M...