Illinois Genetic Algorithms Laboratory

I am pleased to announce that MEDAL Gathering on Evolutionary Computation is going to take place next Monday, July/24/2006 at the University of Missouri in St. Louis. The primary purpose of this even is to celebrate the creation of the Missouri Estimation of Distribution Algorithms Laboratory (MEDAL), hear a number of cool presentations, discuss interesting challenges in research and applications of evolutionary computation and machine learning, and have a free lunch (yes, I’ve heard about the no-free-lunch theorem, too many times in fact). The presentations will include the following:

• Martin Pelikan
  Quo Vadis MEDAL: Current and Planned Projects at MEDAL
• Kenneth P. Turvey
  XCS in Dynamic Environments
• Kumara Sastry
  Efficiency Enhancement of Estimation of Distribution Algorithms
• David E. Goldberg
  Little Models, Big Results
• Cezary Janikow
  Representations and Heuristics in GP
• Moshe Looks
  Towards Competent Genetic Programming - What are the Missing Ingredients?
• Shigeyoshi Tsutsui
  cAS: Ant Colony Optimization with Cunning Ants
• Mark Jakiela

For more details about the event, please visit its web page. I’ll try to provide the live-blogging service at the event, but I may just summarize it afterwards.