19_EvoluionaryAlgorithms - 12/4/2009 Informed vs....

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
12/4/2009 1 Evolutionary Algorithms Hod Lipson Informed vs. Uninformed Algorithms Informed algorithms Knowledge intensive Problem Specific Efficient formal provable Efficient, formal, provable Uninformed algorithms Knowledge sparse Broadly applicable CPU Intensive, non optimal, surprising Evolutionary Algorithms Inspired by biological evolution Darwinian selection Three views Engineering/CS: A problem solving search strategy Biology A simulation of biological evolution Alife Biology: A simulation of biological evolution (Alife) Physics: Directed pattern formation (dynamical systems) Weak algorithm Trade CPU power for knowledge Open ended “The second best algorithm for almost anything” Outline Basic concept Open ended search Key issues Representations Variation operators Selection mechanisms Multiple objectives The four key objectives of search Co evolution Predator/prey dynamics: Multiple populations Modularity A simple evolutionary process 01011010010 10010101010 11101011101 10101001000 Genotype Phenotype 00100101001 00010111101 11111001001 11010101001 Holland, 1975 Reminder: Beam Search 01011010010 10010101010 11101011101 10101001000 01011010110 10011101010 11100011101 10101000000 One Change 01011010010 10010101010 11101011101 10101001000 00100101001 00010111101 11111001001 Combine and Rk 01011010010 11101011101 10011101010 1010100000 Down Selec 00100101001 00010111101 11111001001 11010101001 00101101001 00011111101 11011001001 11110101001 11010101001 01011010110 10011101010 11100011101 10101000000 00101101001 00011111101 11011001001 11110101001 Rank 00100101001 11111001001 10101000000 00011111101 11110101001 Select Iterate
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
12/4/2009 2 Simple Evolutionary Search 01011010010 10010101010 11101011101 10101001000 01011010010 10010101010 11101011101 10101001000 00100101001 00010111101 11111001001 Combine and Rank
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/30/2010 for the course CS 4700 taught by Professor Joachims during the Fall '07 term at Cornell University (Engineering School).

Page1 / 7

19_EvoluionaryAlgorithms - 12/4/2009 Informed vs....

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online