We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
It is supposed that the finite search space has certain symmetries which can be described in terms of a group of permutations acting upon it. If crossover and mutation respect th...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
In this paper we address the weaknesses of current EC applications related to their lack of support for the customer to recognize other people, either other customers or vendors o...
Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to nd a number of ...
Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, Ecka...
In this paper, we develop techniques based on evolvability statistics of the fitness landscape surrounding sampled solutions. Averaging the measures over a sample of equal fitness...
Tom Smith, Phil Husbands, Paul J. Layzell, Michael...