Actions

CSSS 2007 Beijing-Readings-Week-Two: Difference between revisions

From Santa Fe Institute Events Wiki

No edit summary
No edit summary
Line 7: Line 7:
===Lecture Notes===
===Lecture Notes===
===Additional Reading===
===Additional Reading===
*Altenberg, L. , 2004. [http://dynamics.org/Altenberg/PAPERS/OPSAED/ Open Problems in the Spectral Analysis of Evolutionary Dynamics] presents a mathematical framework for evolutionary optimization and some of its unsolved problems. 
*Altenberg, L. , 1994. [http://dynamics.org/Altenberg/PAPERS/STPT/ The Schema Theorem and Price's Theorem] delves into the claims about schema processing as the source of power in genetic algorithms, and recasts the Schema Theorem (Holland 1975) by using Price's Theorem (1970).  It is shown that the Schema Theorem says nothing about a GA's power, but a modification with a different measurement function produces a theorem about evolvability that is a local measure of GA power.  The concept of rugged landscapes is also deconstructed in terms of operator-defined distance.
*Erik van Nimwegen, James P. Crutchfield, and Martijn Huynen [http://www.santafe.edu/~evca/Papers/nemr.pdf Neutral Evolution of Mutational Robustness.] Proceedings of the National Academy of Science U.S.A. 96:9716-9720 (1999).
*Altenberg, L. , 2004. [http://dynamics.org/Altenberg/PAPERS/MESLLQ/ Modularity in Evolution: Some Low Level Questions] deconstructs the concept of modularity in terms of spaces of variation, and discusses properties needed for modularity to enhance evolvability.
*Erik van Nimwegen and James P. Crutchfield.  [http://www.santafe.edu/~evca/Papers/med.pdf Metastable Evolutionary Dynamics: Crossing Fitness Barriers or Escaping via Neutral Paths?]  Bulletin of Mathematical Biology 62:5:799-848 (Sep 2000)
* Evolutionary Art at [http://electricsheep.org/ Electric Sheep]


==Emily Burkhead==
==Emily Burkhead==

Revision as of 20:37, 11 June 2007

CSSS 2007 Beijing


Lee Altenberg

Lecture Notes

Additional Reading

  • Altenberg, L. , 1994. The Schema Theorem and Price's Theorem delves into the claims about schema processing as the source of power in genetic algorithms, and recasts the Schema Theorem (Holland 1975) by using Price's Theorem (1970). It is shown that the Schema Theorem says nothing about a GA's power, but a modification with a different measurement function produces a theorem about evolvability that is a local measure of GA power. The concept of rugged landscapes is also deconstructed in terms of operator-defined distance.

Emily Burkhead

Lecture Notes

Additional Reading

Hao Bai-lin

Lecture Notes

Additional Reading

Dan Hruschka

Lecture Notes

Additional Reading

Van Savage

Lecture Notes

Additional Reading

Weixia(Bonnie) Huang

Lecture Notes

Additional Reading