Topics in Bio-Inspired Computing (202-1-4791)
Semester B, 2002-2003
Lecturer: Prof. Moshe Sipper
Projects must be submitted by the end of
the semester: Friday, June 13, 2003.
Project Assignment
- Amit Barzilai: Evolutionary Algorithms (7), Subset sum
- Arik Maman: Coevolving nonuniform CAs (2)
- Sariel Tidhar: Evolutionary Algorithms (7), TSP
- Tal Lipetst, Tiran Hay: Genetic art (1)
- Israel Aviram: HP problem with GA/Ants
- Joshua Kraer, Igal Galkin: coevolution (3)
- Libi Meshorer, Yohay Levi: DNA Computing simulator (11)
- David Baruch, Ido Peles: Self-replication
- Vadim Pulver, Elena Feygin: DNA Computing simulator (11)
- Liton Almog, David Cohen: Evolutionary Algorithms (7), SAT
- Itay Ashkenazi, Ornit Hochman: Genetic art (1)
- Nir Navon: Evolutionary Algorithms (7), Knapsack
- Shira Chorany: Evolutionary Algorithms (7), Knapsack or SAT
Course Description
- Students will work on software projects in the area of bio-inspired computing.
Manadatory Reading
General Reference
Administrative Details
- Web:
http://www.cs.bgu.ac.il/~sipper/courses/topics03b/.
- Prerequisite: Complexity, Algorithm Design, Data Structures
- Credits: 2.
- Time: Wednesday 10-12.
- Place: Building 90, Room 129.
- Grade:
- 70%: Project evaluation.
- 30%: Final report.
- Students may work on their own or in pairs.
Final Report (please read this carefully!)
- The final report must include the following seven sections:
- A short introduction of the domain being investigated.
- A description of the problem or phenomenon studied.
- An explanation of the methods and algorithms employed.
- A description of your programmed system.
- An account of the results obtained.
- Some interesting conclusions.
- Bibliographic references.
- Language: Hebrew or English.
- Length: 10-20 pages.
- Don't include the code.
- Don't send the report by e-mail: hand in a hard copy.
List of Projects:
- Genetic art: Creating computer images via evolution.
Source:
K. Sims,
Artificial Evolution for Computer Graphics,
Computer Graphics, Vol. 25, No. 4, July 1991, pp. 319-328.
- Coevolving nonuniform cellular automata to perform computations.
Source:
M. Sipper,
Co-Evolving Non-Uniform Cellular Automata to Perform Computations,
Physica D, vol. 92, pp. 193-208, 1996.
- Cooperative/Competitive coevolution.
Source:
M. A. Potter and K. A. De Jong,
Cooperative Coevolution: An Architecture for Evolving Coadapted Subcomponents,
Evolutionary Computation, Vol. 8, No. 1, Spring 2000.
J. Paredis, (1996c), Coevolutionary Computation, Artificial Life Journal,
Vol. 2, No. 4.
- Evolution of self-replicating loops.
Source:
J.D. Lohn, J.A. Reggia,
Automatic Discovery of Self-Replicating Structures in Cellular Automata,
IEEE Transactions on Evolutionary Computation, vol. 1, no. 3, 1997, pp. 165-178.
- Self-replicating loops.
Source:
H. Sayama
A New Structurally Dissolvable Self-Reproducing Loop Evolving in a
Simple Cellular Automata Space,
Artificial Life, Vol. 5, No. 4, Fall 1999.
More information can be found
here.
- A simulator for Braitenberg vehicles (a series of simulated robots, going from
very simple ones to more complex ones).
Source:
V. Braitenberg, Vehicles: Experiments in Synthetic Psychology,
The MIT Press, 1984, Cambridge, Massachusetts. (A small, beautifully written book.)
See the following
page for more information.
- Select a hard problem you've encountered during your computer-science
studies, and attempt to solve it with a genetic algorithm.
Source:
M. Tomassini,
Evolutionary Algorithms.
- Work with Khepera robots.
- Genetic programming (working with one of the existing packages).
See paper by Brad Dolin, J.J. Merelo available from
Kluwer Online (a copy is available
here).
- Adaptive
environmentics.
- DNA Computing simulator.
``Computing with DNA,'' L. Adelman, Scientific American, pp. 54-61 (Aug 1998)
See the following
page for more information.