Actions

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

From Santa Fe Institute Events Wiki

Line 38: Line 38:


===Additional Reading===
===Additional Reading===
[[Media:crossSFI.pdf|Complexity, Coarse-Graining and Symbolic Description]]
[[Media:crossSFI.pdf|Complexity, Coarse-Graining and Symbolic Description]] SFI Working Paper


==Dan Hruschka==
==Dan Hruschka==

Revision as of 03:38, 15 July 2007

CSSS 2007 Beijing


Lee Altenberg

Lecture Notes

These are from the 2006 CSSS Beijing, and will have some revisions for this year:

  • Lecture 1: Introduction to Evolutionary Computation (6.15MB)
  • Lecture 2: Analysis of Evolutionary Dynamics (1 MB)
  • Lecture 3: Higher Order Evolutionary Phenomena (2.51MB)

    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

    Coarse-graining, symbolic description, and complexity

    Additional Reading

    Complexity, Coarse-Graining and Symbolic Description SFI Working Paper

    Dan Hruschka

    Lecture Notes

    Additional Reading

    Van Savage

    Lecture Notes

    Additional Reading

    Weixia(Bonnie) Huang

    Lecture Notes

    Additional Reading