CPSC 689-608: Seminar in Robotics 
Segment on GAs and Systems 
Spring 2002

• 02/28/02: Introduction to Genetic Algorithms (GAs) - Paul Thomas
• Genetic Algorithms Applied to Protein Structure Prediction - Mehul M Khimasia

Read this paper and prepare a summary for class. Concentrate on the following sections:
•   Section 1
•   Section 2.1 & 2.2
•   Section 4 ( especially 4.3.1)
•   Section 5
• Introduction to Genetic Algorithms - http://www.cs.qub.ac.uk/~M.Sullivan/ga/ga_index.html - Easy to read
  
• C.R.Reeves (1995) A genetic algorithm for Flowshop sequencing. Computers & Opns Res., 22, 5-13.
  This can be accessed from electronic journal section in Tamu Library.
  Only one copy of the paper can be made and it can't be distributed through Email or Internet.
  
• Genetic Algorithms and the Traveling Salesman Problem - Kylie Bryant
• 03/07/02: GAs for Compiler Optimizations - Mark Mathis
• Required: Optimizing for reduced code space using genetic algorithms, ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES), Atlanta, GA, 1999, will appear as an issue of SIGPLAN Notices) (with P. Schielke and K. D. Cooper). This paper gives the most details about the genetic algorithm used. Read this paper and prepare a summary for class.
• Optional: Adaptive optimizing compilers for the 21st century, Journal of Supercomputing, 2002 (to appear). Also appeared in the Proceedings of the LACSI symposium, Fall 2001. Here's the talk at the LACSI symposium, Fall 2001 (with K. Cooper and L. Torczon). This paper and accompanying talk focus on the characterization of the search space explored by the genetic algorithm.
• Optional: Compilation order matters , Technical Report, January 2002, Rice University (with K. Cooper, L. Torczon and T. Harvey). This paper is a somewhat higher level and broader summary of the previous paper(s).
• 03/21/02: GAs for System Modeling - Jack Perdue
• Required: Gene Expression Programming: a New Adaptive Algorithm for Solving Problems, Candida Ferreira, 2001. - local copy - concentrate on Sections 1-5. Feel free to explore the examples in Section 6. Also, for another approach on GA's (review), see the accompanying tutorial.
• 03/28/02: GAs for Scheduling - Ping "Ann" An
• Required: A Parallel Genetic-Search-Based Algorithm for Scheduling Arbitrary Task Graphs to Multiprocessors, Yu-Kwong Kwok and Ishfaq Ahmad, Proceedings of the 9th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS'97), pp. 245-248, Washington, D.C., USA, October 1997. (This gives an example on parallelizing GA. Please prepare a summary for this one.)
• Optional: Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors Yu-Kwong Kwok and Ishfaq Ahmad, ACM Computing Surveys, vol. 31, no. 4, December 1999. (This is a good survey paper with 91 pages. Sections excluding 5 and 6, about 30 pages, should be helpful to get one familiar with the task scheduling problem, the heuristics designed so far, and the state of the arts. Section 5 and 6 are details about the techniques and algorithms.)