|
James A. Foster |
|
|
Evolutionary Computation (Spring 1998)Evolutionary computation solves problems the old fashioned way: by growing solutions. Given a problem, EC simulates evolution with natural selection, where the "organisms" to be evolved are either potential solutions to the problem at hand, or algorithms to produce such solutions. EC includes: Genetic Algorithms, Genetic Programming, Evolutionary Strategies, evolutionary algorithms, and many artificial life simulations. It has been successful for a remarkable number and variety of problems. In this course, we will work through several case studies which apply EC to function optimization, automatic program derivation, classification, machine learning, circuit design, and other types of problems. We will investigate EC in general, and many specific variations. We will investigate the current theory of EC, including: schemata theory, exact modeling, statistical mechanics, and more. Our objective is to understand the EC technique well enough to be able to apply it successfully.
Instructor: Dr. James A. Foster. I respond better to email than to any other communications venue.
Announcements
|
|
Last Updated 01/13/2003 15:56 -0800 |
![]()
foster@cs.uidaho.edu
Last modified: Tue Apr 28 10:20:36 1998