[comp.ai.digest] Conference - Genetic Algorithms

gref@NRL-AIC.ARPA.UUCP (06/12/87)

                    Second International Conference on
                 Genetic Algorithms and Their Applications

                             July 28-31, 1987
                                    MIT
                         Cambridge, Massachusetts

                               Sponsored By
             American Association for Artificial Intelligence
                         Naval Research Laboratory
                       Bolt Beranek and Newman, Inc.

     Genetic algorithms are adaptive search techniques based on
     principles derived from natural population genetics, and are
     currently being applied to a variety of difficult problems in
     science, engineering, and artificial intelligence.  Topics for
     discussion will include:

             Fundamental research on genetic algorithms
             Machine learning using genetic algorithms
             Implementation techniques,
                     especially on parallel processors
             Relationships to connectionism and other
                     search and learning techniques
             Application of genetic algorithms

     Conference Committee:

     John H. Holland         University of Michigan
                                     (Conference Chair)
     Lashon B. Booker        Navy Center for Applied Research in AI
     Dave Davis              Bolt Beranek and Newman, Inc.
     Kenneth A. De Jong      George Mason University
     David E. Goldberg       University of Alabama
     John J. Grefenstette    Navy Center for Applied Research in AI
                                     (Program Chair)
     Stephen F. Smith        Carnegie-Mellon Robotics Institute
     Stewart W. Wilson       Rowland Institute for Science
                                     (Local Arrangements)

     The registration fee is $120 ($175 after June 15) and
     includes admission to all sessions, the Conference Proceedings,
     a Welcoming Reception, and all coffee breaks and lunches.
     The Conference Banquet is $30 additional per person. The
     Registration fee for students is $60. For registration forms
     and information concerning local arrangements, contact:

             Conference Services Office
             Room 7-111
             Massachusetts Institute of Technology
             77 Massachusetts Avenue
             Cambridge, MA 02139
             (617) 253-1703

     For copies of the Conference Proceedings, contact:

             Lawrence Erlbaum Associates, Publishers
             365 Broadway
             Hillsdale, New Jersey 07642





                            CONFERENCE PROGRAM


     TUESDAY, JULY 28, 1987

     5:00 - 9:00   REGISTRATION

     7:00 - 9:00   WELCOMING RECEPTION

     7:00 - 9:00   TUTORIAL (if sufficient interest)


     WEDNESDAY, JULY 29, 1987

     8:00           REGISTRATION

     9:00           OPENING REMARKS

     9:20 - 10:40   GENETIC SEARCH THEORY

     Finite Markov chain analysis of genetic algorithms
     David E. Goldberg and Philip Segrest

     An analysis of reproduction and crossover in a
     binary-coded genetic algorithm
     Clayton L. Bridges and David E. Goldberg

     Reducing bias and inefficiency in the selection algorithm
     James E. Baker

     Altruism in the bucket brigade
     Thomas H. Westerdale

     10:40 - 11:00   COFFEE BREAK

     11:00 - 12:00   ADAPTIVE SEARCH OPERATORS I

     Schema recombination in pattern recognition problems
     Irene Stadnyk

     An adaptive crossover distribution mechanism for
     genetic algorithms
     J. David Schaffer and Amy Morishima

     Genetic algorithms with sharing for multimodal
     function optimization
     David E. Goldberg and Jon Richardson

     12:00 - 2:00   LUNCH

     2:00 - 3:20   REPRESENTATION ISSUES

     The ARGOT strategy: adaptive representation genetic
     optimizer technique
     Craig G. Shaefer

     Nonstationary function optimization using genetic
     algorithms with dominance and diploidy
     David E. Goldberg and Robert E. Smith

     Genetic operators for high-level knowledge representations
     H. J. Antonisse and K. S. Keller

     Tree structured rules in genetic algorithms
     Arthur S. Bickel and Riva Wenig Bickel

     3:20 - 3:40   COFFEE BREAK

     3:40 - 5:00   KEYNOTE ADDRESS

     Genetic algorithms and classifier systems: foundations
     and future directions
     John H. Holland

     7:00 - 9:00   BUSINESS MEETING


     THURSDAY, JULY 30, 1987

     9:00 - 10:20   ADAPTIVE SEARCH OPERATORS II

     Greedy genetics
     G.E. Liepins, M.R. Hilliard, Mark Palmer
     and Michael Morrow

     Incorporating heuristic information into genetic search
     Jung Y. Suh and Dirk Van Gucht

     Using reproductive evaluation to improve genetic
     search and heuristic discovery
     Darrell Whitley

     Toward a unified thermodynamic genetic operator
     David J. Sirag and Paul T. Weisser

     10:20 - 10:40   COFFEE BREAK

     10:40 - 12:00   CONNECTIONISM AND PARALLELISM I

     Toward the evolution of symbols
     Charles P. Dolan and Michael G. Dyer

     SUPERGRAN: a connectionist approach to learning,
     integrating genetic algorithms and graph induction
     Deon G. Oosthuizen

     Parallel implementation of genetic algorithms in a
     classifier system
     George G. Robertson

     Punctuated equilibria: a parallel genetic algorithm
     J.P. Cohoon, S.U. Hegde, W.N. Martin and D. Richards

     12:00 - 2:00   LUNCH

     2:00 - 3:20    PARALLELISM II

     A parallel genetic algorithm
     Chrisila B. Pettey, Michael R. Leuze and John J. Grefenstette

     Genetic learning procedures in distributed environments
     Adrian V. Sannier II and Erik D. Goodman

     Parallelisation of probabilistic sequential search algorithms
     Prasanna Jog and Dirk Van Gucht

     Parallel genetic algorithms for a hypercube
     Reiko Tanese

     3:20 - 3:40   COFFEE BREAK

     3:40 - 5:00   CREDIT ASSIGNMENT AND LEARNING

     Bucket brigade performance: I. Long sequences of classifiers
     Rick L. Riolo

     Bucket brigade performance: II. Default hierarchies
     Rick L. Riolo

     Multilevel credit assignment in a genetic learning system
     John J. Grefenstette

     On using genetic algorithms to search program spaces
     Kenneth A. De Jong

     6:30 - 10:00   CLAM BAKE


     FRIDAY, JULY 31, 1987

     9:00 - 10:20   APPLICATIONS I

     A genetic system for learning models of consumer choice
     David Perry Greene and Stephen F. Smith

     A study of permutation crossover operators on the
     traveling salesman problem
     I.M. Oliver, D.J. Smith and J. R. C. Holland

     A classifier based system for discovering scheduling heuristics
     M.R. Hilliard, G.E. Liepins, Mark Palmer,
     Michael Morrow and Jon Richardson

     Using the genetic algorithm to generate LISP source code
     to solve the prisoner's dilemma
     Cory Fujiko and John Dickinson

     10:20 - 10:40   COFFEE BREAK

     10:40 - 12:00   APPLICATIONS II

     Optimal determination of user-oriented clusters:
     an application for the reproductive plan
     Vijay V. Raghavan and Brijesh Agarwal

     The genetic algorithm and biological development
     Stewart W. Wilson

     Genetic algorithms and communication link speed design:
     theoretical considerations
     Lawrence Davis and Susan Coombs

     Genetic algorithms and communication link speed design:
     constraints and operators
     Susan Coombs and Lawrence Davis

     12:00 - 2:00   LUNCH

     2:00 - 3:20    PANEL DISCUSSION: GA's and AI

     3:20 - 3:40    COFFEE BREAK

     3:40 - 5:00    INFORMAL DISCUSSION AND FAREWELL