Abstract

It is shown by means of Markov chain analysis that unimodal binary long-path problems can be solved by mutation and elitist selection in a polynomially bounded number of trials on average.

This content is only available as a PDF.