A Discipline of Evolutionary Programming

Computer Science – Neural and Evolutionary Computing

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

25 pages, LaTeX source, Theoretical Computer Science, To appear

Scientific paper

Genetic fitness optimization using small populations or small population updates across generations generally suffers from randomly diverging evolutions. We propose a notion of highly probable fitness optimization through feasible evolutionary computing runs on small size populations. Based on rapidly mixing Markov chains, the approach pertains to most types of evolutionary genetic algorithms, genetic programming and the like. We establish that for systems having associated rapidly mixing Markov chains and appropriate stationary distributions the new method finds optimal programs (individuals) with probability almost 1. To make the method useful would require a structured design methodology where the development of the program and the guarantee of the rapidly mixing property go hand in hand. We analyze a simple example to show that the method is implementable. More significant examples require theoretical advances, for example with respect to the Metropolis filter.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Discipline of Evolutionary Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Discipline of Evolutionary Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Discipline of Evolutionary Programming will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-457982

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.