Read our guid to find the best vps hosting for your business

 

 

 

 

 

EVOLVE 2011

 

A bridge between Probability, Set Oriented Numerics and Evolutionary Computation

 

Workshop organized by

University of Luxembourg

CINVESTAV, Mexico

INRIA Bordeaux Sud-Ouest



http://evolve.uni.lu

May 25-27 (Wednesday-Friday), 2011
Bourglinster Castle, Luxembourg

SUBMISSION DEADLINE: April 5, 2011

 

Partners of the Event

Computer Science and Communications Research Unit, Luxembourg

Interdisciplinary Centre for Security, Reliability and Trust (SnT), Luxembourg

EA Association, France

Association Evolution Artificielle

Ministère de la Culture, de l'Enseignement Supérieur et de la Recherche, Grand Duché de Luxembourg


The massive use and large applicability spectrum of evolutionary algorithms for real-life applications determined the need of establishing solid theoretical grounds. Only to offer a few examples, one may consider mathematical objects that are sometimes difficult and/or costly to calculate. At the same time, acknowledged new results show that evolutionary computation can provide in some cases good and fast estimators of these quantities. Similarly, the handling of large quantities of data may require the use of distributed environments where the probability of failure and the stability of the algorithms may need to be addressed. What is more, common practice confirms in many cases that theory based results have the advantage of ensuring performance guarantee factors for evolutionary algorithms in areas as diverse as optimization, bio-informatics or robotics.

The aim of the EVOLVE workshop is to build a bridge between probability, statistics, set oriented numerics and evolutionary computing, as to identify new common and challenging research aspects. The workshop is also intended to foster a growing interest for robust and efficient methods with a sound theoretical background. EVOLVE is intended to unify theory-inspired methods and cutting-edge techniques ensuring performance guarantee factors. By gathering researchers with different backgrounds, ranging from computer science to mathematics, statistics and physics, to name just a few, a unified view and vocabulary can emerge where the theoretical advancements may echo in different domains.

The EVOLVE 2011 workshop represents a follow-up of the Workshop on Evolutionary Algorithms - New Challenges in Theory and Practice, organized by the ALEA Working Group in Bordeaux, France, March 2010, with the support of the EA association.

 

Topics of interest

- bridge between probability, statistics and evolutionary algorithms

- performance guarantee factors for large scale / highly multi-modal optimization problems

- performance guarantees measures for existing algorithms

- estimation of complete distribution laws

- Gibbs measures

- set oriented numerics

- robust methods for large scale, high dimensional problems

- theoretical tools, components that ensure the robustness in practice

- theoretical foundations

- mathematical objects and evolutionary programming

- robust / fast estimation of mathematical quantities

- particle methods, Markov Chain Monte Carlo methods

- spatial complexity of methods and its implications in practice

- robustness of parallel and distributed evolutionary optimization

- self-tuning and self-adaptive techniques based on theoretical analysis

- particular issues (e.g. landscape analysis, complex networks)

- swarm intelligence

 

Keynote speakers

Enrique Alba University of Málaga, Spain
Carlos A. Coello Coello Department of Computer Science, CINVESTAV-IPN, México
Pierre Del Moral INRIA Bordeaux - Sud Ouest, Bordeaux Mathematical Institute, France
Michael Dellnitz Institute for Mathematics, University of Paderborn, Germany
Frédéric Guinand University of Le Havre, France
Günter Rudolph Department of Computer Science, TU Dortmund University, Germany
Marc Schoenauer INRIA Saclay - Île-de-France, University Paris Sud, France
Franciszek Seredynski Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland
El-Ghazali Talbi Polytech' Lille, University of Lille 1, France
Marco Tomassini Faculty of Business and Economics, University of Lausanne, Switzerland
Massimiliano Vasile Space Advanced Research Team, University of Glasgow, Scotland

 

Submission

We invite researchers working on both theoretical and practical aspects of evolutionary algorithms to submit an abstract of t;em>maximum two pages. The submissions have to be done exclusively through EasyChair, at the following address: http://www.easychair.org/conferences/?conf=evolve2011. All submissions must be in English. The final submission must include the PDF file along with all the accompanying source files (LaTeX file, figures). An EasyChair account is mandatory - in case you do not have an EasyChair account, you can create one for free at EasyChair.

The final version of the abstract must be uploaded on EasyChair before the 15th of May 2011.

 

Publication

The accepted abstracts will appear in proceedings which will be handed out at the event. In addition, all accepted authors will be invited to submit an extended version of their work to a journal special issue (to be announced later).

Further, authors will be invited to contribute with an extended version of their work to uot;EVOLVE - A bridge between Probability, Set Oriented Numerics and Evolutionary Computation", in the series Studies in Computational Intelligence, Springer (edited book on the theoretical foundations of evolutionary computation, indexed by DBLP, Ulrichs, SCOPUS, MathSciNet, Current Mathematical Publications, Mathematical Reviews, Zentralblatt Math: MetaPress and Springerlink).

 

Important dates

Submission deadline April 5, 2011
Notification of acceptance April 20, 2011
Registration deadline May 13, 2011
Conference dates May 25-27, 2011

 

Contacts

EVOLVE 2011 is organized by Alexandru-Adrian Tantar, Emilia Tantar, Pascal Bouvry (University of Luxembourg), in collaboration with Oliver Schütze (CINVESTAV, Mexico), Pierre Del Moral and Pierrick Legrand (INRIA, France).

For questions or additional information please do not hesitate to contact Alexandru-Adrian Tantar or Emilia Tantar.

 
free pokerfree poker