Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Drawn from empirical studies on spatial cognition, this work explores ways of dynamically integrating others' perspectives and incorporating different views into a single int...
In a comparative map, the number of translocations in the evolutionary history of a chromosome can be estimated solely on the basis of the conserved syntenies it contains. This est...