Publications

2001

• EASEA : un langage de spécification pour les algorithmes évolutionnaires
  
  • Collet Pierre
  • Schoenauer Marc
  • Lutton Evelyne
  • Louchet Jean
  , 2001, pp.17. Evolutionary algorithms are not straightforward to implement and the lack of any specialised language forces users to write their algorithms in C, C++ or JAVA. However, most evolutionary algorithms follow a similar design, and the only really specific part is the code representing the problem to be solved. Therefore, it seems that nothing, in theory, could prevent a user from being able to design and run his evolutionary algorithm from a Graphic User Interface, without any other programming effort than the function to be optimised. Writing such a GUI rapidly poses the problem of saving and reloading the evolutionary algorithm on which the user is working, and translating the information into compilable code. This very much sounds like a specifying language and its compiler. The EASEA software was created on this purpose, and to our knowledge, it is the first and only usable compiler of a language specific to evolutionary algorithms. This reprot describes how EASEA has been designed and the problems which needed to be solved to achieve its implementation.
• Vanishing cycles and mutation
  
  • Seidel Paul
  , 2001, pp.65-85. This is the writeup of a talk given at the European Congress of Mathematics, Barcelona. It considers Picard-Lefschetz theory from the Floer cohomology viewpoint.