Thursday, March 24, 2011

[DMANET] Extended Deadline EVOLVE 2011, May 25-27 2011, Bourglinster Castle, Luxembourg

Apologies for cross-postings.

*****************************************************************

E V O L V E

A bridge between Probability, Set Oriented Numerics and
Evolutionary Computation

http://evolve.uni.lu

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

Workshop organized by
University of Luxembourg, CINVESTAV and INRIA

EXTENDED SUBMISSION DEADLINE: April 5, 2011

*****************************************************************

Deadline Extension !!!

Due to the addition of specific sessions and given the multiple extension
requests, the deadline has been extended to the 5th of April, 2011.
Submitted abstracts should be from two to maximum four pages long.


NEWS!!! -------------------------------------------------------------------
Authors will be invited to submit extended versions of the abstracts,
subject to further review to be published in "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).
---------------------------------------------------------------------------


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 (include but are not limited to)
***************************************

- 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 Malaga, Spain
Carlos A. Coello Coello Department of Computer Science, CINVESTAV-IPN,
Mexico
Pierre Del Moral INRIA Bordeaux - Sud Ouest,
Bordeaux Mathematical Institute, France
Michael Dellnitz Institute for Mathematics,
University of Paderborn, Germany
Frederic 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 Strathclyde, Scotland


Submission
*********

We invite researchers working on both theoretical and practical aspects of evolutionary algorithms to submit an abstract of 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 5th of April 2011. Authors who cannot meet the specified deadline are invited to contact the EVOLVE organizers.


Publication
*********
Authors will be invited to submit full papers, that will be published subject to further review in "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).

All the accepted abstracts will be presented orally at the workshop and will appear in proceedings that will be handed out at the event. In addition, all accepted authors will be invited to submit an extended version of their work also to a journal special issue (to be announced).

Important dates
************
Submission deadline: April 5, 2011
Notification of acceptance: April 15, 2011
Registration deadline: April 25, 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 us at Alexandru.Tantar@uni.lu or Emilia.Tantar@uni.lu.

___________________________________________________________________________

The call is also available online on the EVOLVE 2011 website at http://evolve.uni.lu/index.php/call-for-abstracts
___________________________________________________________________________
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************