LISTSERV mailing list manager LISTSERV 16.0

Help for EC-DIGEST-L Archives

EC-DIGEST-L Archives

EC-DIGEST-L Archives













By Topic:










By Author:











Proportional Font





EC-DIGEST-L  January 2010

EC-DIGEST-L January 2010


EC-Digest v24n1


Adam Campbell <[log in to unmask]>


Evolutionary Computation Digest <[log in to unmask]>


Tue, 5 Jan 2010 22:22:14 -0500





text/plain (488 lines)

Evolutionary Computation Digest Monday, January 4, 2010 Volume 24: Issue 1

SUBMISSION ADDRESS:    [log in to unmask]

(UN)SUBSCRIPTION INSTRUCTIONS:  at the bottom of this email


Today's Topics:

   - RE: PhD studentship
   - Open PhD position in "Bio-Inspired Computation" at Max Planck Inst...

   - Novel Scalable Constrained Problems for CEC 2010 Competition and special...
   - Generative and Developmental Systems Track, GECCO 2010, 2nd Call for Pap...
   - Announcement GECCO-Workshop "Evolutionary Computation Techniques for Con...
   - ICNC'10-FSKD'10 Submission Deadline 15 January: EI Compendex & IEEE Xplore
   - IIS 2010 - 1st CFP
   - IPMU2010 special session on evolutionary algorithms


CALENDAR OF GA-RELATED ACTIVITIES: (with EC-Digest issue reference)

EVO* 2010, EuroGP EvoCOP EvoBIO and EvoAppl., Istanbul, Turkey,Apr7-9 '10(v23n7)
NICSO10,IV Intl Wksp on Nature Inspired ..., Granada, Spain,May 12-14 '10(v23n7)
IIS'10,18th Intl Conf on Intel Inform Syst, Siedlce, Poland, June 8-10'10(v24n1)
ICML-10, Intl Conference on Machine Learning, Haifa,Israel,June 21-25'10(v23n10)
GECCO'10,Genetic and Evol Comp Conference, Portland, Oregon,July 7-11 '10(v23n9)
ANTS10,7th Intl Conf on Swarm Intelligence, Brussels, Belgium,Sep8-10 '10(v23n9)
PPSN'10,11th Intl Conf on Parallel Problem ..., Krakow, Poland, Sep 11-15(v23n9)

Sender: Larry Bull <[log in to unmask]>
Subject: RE: PhD studentship

A fully-funded PhD studentship in Evolutionary Computation is available within
the AI Group at the University of the West of England (
for an EU citizen. Possible projects would include (but are not be limited to):
 - interactive evolutionary algorithms using multi-modal haptic interfaces
 - co- adaptation of evolutionary, social and individual learning systems
 - extensions of Learning Classifier Systems

For further details please contact Dr Jim Smith [log in to unmask]

Sender: Frank Neumann <[log in to unmask]>
Subject: Open PhD position in "Bio-Inspired Computation" at Max Planck Institute
         for Informatics

The group Bio-Inspired Computation at the
M A X   P L A N C K   I N S T I T U T E
in Saarbrücken, Germany seeks a
Ph.D. Student
for the Algorithms and Complexity Department
directed by Kurt Mehlhorn

We are seeking an excellent candidate with a master or diploma in mathematics,
theoretical computer science or a related field. The successful applicant should
carry out theoretical work on evolutionary algorithms, ant colony optimization
and related bio-inspired computing methods. Candidates having experiences in the
field of randomized methods and/or computational complexity of bio-inspired
computation are highly encouraged to apply.

The Max Planck Institute for Informatics is located on the campus of the
Universität des Saarlandes in Saarbrücken, Germany. Currently, around 40
researchers from several nationalities work in the Algorithms and Complexity
Department. Our working language is English. The group collaborates with several
of the major research institutions in Europe and the U.S. and has high
international visibility. There is generous travel support available for all
group members.

Applications from disabled applicants are appreciated. Our institute supports
the principle of equal opportunity for men and women, and is therefore
interested in applications from women.

Applications (including curriculum vitae, list of publications if applicable
list of school grades, list of university grades, and names of two references
with their e-mail addresses) must be sent by email in PDF format to Frank
Neumann (frank.neumann(at)mpi-inf(dot)mpg(dot)de)  by January 31, 2010.

For further information, also on other offers, please refer to

Sender: Ponnuthurai Nagaratnam Suganthan (Assoc Prof) <[log in to unmask]>
Subject: Novel Scalable Constrained Problems for CEC 2010 Competition and
         special Session on Constrained Optimization

Competition & Special Session on Constrained Numerical Optimization @ CEC10,
Barcelona, Spain, July 18-23 "There is an urgent need to upgrade the current
single objective constrained optimization test suite (CEC 2006) by increasing
dimensional scalability."  CEC 2010
Competition & Special Session on Constrained Optimization

Most optimization problems have constraints of different types which modify the
shape of the search space. During the last two decades, a wide variety of
metaheuristics have been designed and applied to solve constrained optimization
problems. Evolutionary algorithms and most other metaheuristics naturally
operate as unconstrained search techniques. Therefore, they require an
additional mechanism to handle constraints during the search process.
Historically, the most common approach to handling constraints are the penalty
functions originally proposed in the 1940s and later expanded by many
researchers. Penalty functions are not effective if the optimum lies in the
boundary between the feasible and the infeasible regions or when the feasible
region is disjoint. Researchers have also proposed a number of other approaches
to handle constraints such as the self-adaptive penalty, epsilon constraint
handling and stochastic ranking. Developing novel constraint handling methods
and investigating the performances of search engines on solving constrained
problems have attracted much interest recently.

Irrespective of the high level of interest in constrained real-parameter
optimization, the current constrained optimization test suite (CEC 2006
Benchmark Problems) has dimensions between 2 and 20 which is very low. In
addition, CEC 2006 benchmark has been solved satisfactorily by several methods.
Therefore, it has become impossible to demonstrate the superior performance of
newly designed algorithms. Therefore, there is an urgent need to upgrade the
current test suite by increasing dimensional scalability and by considering the
types of constraints (equality, inequality, linear, nonlinear, dimensionality,
active, etc.), types of objective functions (linear, quadratic, nonlinear,
multimodality, separability, etc.), connectivity / relative size of feasible
region and so on. In addition, it would be beneficial to evaluate and, if
necessary, develop novel performance measures to deal with the diverse
characteristics of the real-world constrained optimization problems. We plan to
present an extended test suite and standardized evaluation measures for
researchers to test their algorithms till the CEC'2010 submission deadline in
late January 2010. Along with the papers, we would also optionally like
participants to submit their codes and we shall put it up on a web-site for
anyone to try out. The submitted papers will be peer-reviewed and selected
authors will be invited to present their results during CEC-2010. We hope this
exercise will be helpful for researchers interested in this field and may
generate new ideas to advance the research in this area.

With this background and thoughts, we now invite you give your
feedbacks/suggestions on the extended test suite and evaluation metrics and
would like to know if you would be willing to participate in this exercise. Any
sort of search engine is allowed, including hybrids with mathematical
programming techniques as well as different metaheuristics. Please could you
kindly send an email to the organizers with the following details?

  1. Name:
  2. Email:
  3. URL:
  4. I am interested in participating in this special session: Yes/No
  5. My preferred procedure for constrained optimization:
  6. If you know of researchers who might be interested in making
     contribution(s), please kindly provide names/email addresses. Thank you.

We have the codes of the test functions and a draft technical report available
now from We request you to try out these
problems and give us your feedback to improve these problems further.

Sender: Jeff Clune <[log in to unmask]>
Subject: Generative and Developmental Systems Track, GECCO 2010, 2nd Call for
         Papers and Participation


Dear Generative and Developmental Systems (GDS) Researcher,

We invite you to submit a paper to the GDS track at GECCO 2010, which we
believe is the premier conference for GDS-related work worldwide.

Our program committee of GDS experts means that your paper will be
reviewed by many leaders in the field. Moreover, the attendance at the
GDS track has been high ever since it started in 2007. The size and
prestige of the GECCO conference will allow many researchers to learn
about your work, both at the conference and via the proceedings (GECCO
has the highest impact rating of all conferences in the field of
Evolutionary Computation and Artificial Life*).

This track focuses on work which has gone by many names, such as
artificial development, artificial embryogeny, computational embryology,
generative systems, indirect encodings, developmental encodings, genetic
regulatory networks (GRNs), Lindenmayer Systems (L-Systems), genotype to
phenotype mappings, etc. We invite papers on these topics or related

We also want to alert you to the historical importance of this track.
Many of you share our excitement about this field and its connection to
the powerful capabilities of biological encoding and development. For
many years, there was no consistent annual venue to which researchers in
this area could submit papers to be reviewed by a committee of GDS

Most opportunities to present work in this area have been through one-
time workshops or symposia that do not carry the same weight as a GECCO
conference publication.

To address this gap, a committee of GDS researchers encouraged GECCO to
establish an official conference track in 2007. With the establishment of
the track, we now have an opportunity to build a strong and consistent
community that can improve and flourish over time.

However, the track can only survive with your submissions.   It is
important to note that GECCO permanently cancels tracks that fail to
attract sufficient submissions.  Therefore, our community can preserve
this new resource only by contributing papers.  We know that you have
many options for submitting your GDS-related ideas, and we hope that you
will consider the long-term investment that GDS represents for the
community.  Our program committee is selected from among the top GDS
researchers in the world, and we hope that our track will continue to
flourish with your enthusiasm.

* Submission deadline: January 13, 2010
* Notification of paper acceptance: March 10, 2010
* Camera-ready submission: April 5, 2010
* GECCO-2010 Conference: July 7-11, 2010

The conference will be held July 7-11, 2010 in the very nice city of
Portland, Oregon, USA.

For more information, please see the GECCO homepage at

Best Regards,
Jeff Clune and Julian Miller
2010 GECCO GDS Track Chairs

Sender: Thomas Jansen <[log in to unmask]>
Subject: Announcement GECCO-Workshop "Evolutionary Computation Techniques for
         Constraint Handling"

Carlos Artemio Coello Coello, CINVESTAV-IPN, Mexico
Dara Curran, Cork Constraint Computation Centre, University College
Cork, Ireland
Thomas Jansen, Department of Computer Science, University College Cork,

Evolutionary algorithms are often applied to difficult optimization
problems where candidate solutions are subject to various constraints.
There is a large body of practical guidelines and theoretical results
about evolutionary algorithms in the context of constrained
optimization. Closely related is the subject of constraint programming
where some solution satisfying all constraints is sought. In both
contexts evolutionary computation techniques can be and are applied to
solve hard problems. The workshop intends to provide a forum for current
research in these areas. Algorithmic techniques, case studies,
theoretical and empirical analyses are all welcome. While focusing on
handling constraints we intend to provide a forum for discussion,
therefore allowing generous time slots for each presentation and ample
time for discussions.

We invite submissions that can be in the form extended abstracts as well
as complete papers. Papers describing ongoing research are also welcome.
Submission should be in ACM format and not exceed eight pages in length.
Please, send your submission to [log in to unmask]
Each submitted paper will by independently reviewed by at least three
reviewers. Accepted papers will be included in the GECCO 2010 material
and appear as part ACM's digital library.

Important Dates
submission: March 25, 2010
notification: April 1, 2010
camera-ready: April 13, 2010

Sender: ICNC'10-FSKD'10 <[log in to unmask]>
Subject: ICNC'10-FSKD'10 Submission Deadline 15 January: EI Compendex &
         IEEE Xplore

We cordially invite you to submit a paper or invited session proposal to the
upcoming 6th International Conference on Natural Computation (ICNC'10) and
the 7th International Conference on Fuzzy Systems and Knowledge Discovery
(FSKD'10), to be jointly held from 10-12 August 2010, in Yantai, China.

Yantai was listed as one of the world's most inhabitable places by the
United Nations and was recognized as the "most charming city of China" by
China Central Television. Undulating hills rise above the area's many rivers
and are framed by beaches and neighboring islands. During summer, the breeze
wafts from the sea, and the hills become ornamented with a sea of
wildflowers. Famous tourist attractions include the Tashan Mountain,
Kongdong Island, and Penglai Pavilion Scenic Area. Seafood and fruits are
plentiful in Yantai.

Selected best papers will appear in SCI-indexed journal(s). All papers in
conference proceedings will be indexed by both EI Compendex and ISTP, as
well as the IEEE Xplore.

ICNC-FSKD is a premier international forum for scientists and researchers to
present the state of the art of data mining and intelligent methods inspired
from nature, particularly biological, linguistic, and physical systems, with
applications to signal processing, design, and more. Previously, the joint
conferences in 2005 through 2009 each attracted over 3000 submissions from
around the world. ICNC'10-FSKD'10 is technically co-sponsored by the IEEE
Circuits and Systems Society. The registration fee of US*D 390 includes
proceedings, lunches, dinners, banquet, coffee breaks, and all technical

To promote international participation of researchers from outside the
country/region where the conference is held (i.e., China's mainland),
researchers outside of China's mainland are encouraged to propose invited
sessions. The first author of each paper in an invited session must not be
affiliated with an organization in China's mainland. All papers in the
invited sessions can be marked as "Invited Paper". One organizer for each
invited session with at least 6 registered papers will enjoy an honorarium
of US*D 400. Invited session organizers will solicit submissions, conduct
reviews and recommend accept/reject decisions on the submitted papers.
Invited session organizers will be able to set their own submission and
review schedules, as long as a list of recommended papers is determined by
30 March 2010. Each invited session proposal should include: (1) the name,
bio, and contact information of each organizer of the invited session; (2)
the title and a short synopsis of the invited session. Please send your
proposal to [log in to unmask]

For more information, visit the conference web page:

If you have any questions after visiting the conference web page, please
email the secretariat at [log in to unmask]

Join us at this major event in beautiful Yantai !!!

Sender: IIS'10 Conference <[log in to unmask]>
Subject: IIS 2010 - 1st CFP

                           CALL FOR PAPERS:
                    The 18th International Conference
                   Siedlce, Poland, June 8-10, 2010
             Conference Web page:

The conference will cover a broad spectrum of areas related to intelligent
information systems including:

- Tools and Methods of AI
 - Multiagent systems
 - Evolutionary and reconfigurable distributed systems
 - Parallel and distributed graph transformations
 - Recognition classification and regression systems
 - New optimization technologies
 - Applied data mining using statistical and non-standard approaches
 - Intelligent control systems.
 - Cellular automata
 - Neural networks
 - Adaptive design processes

Important Dates:
March  1, 2010 - paper submission deadline
April 14, 2010 - acceptance/rejection decision due
April 26, 2010 - submission of camera-ready papers
June   8, 2010 - the Conference starts

The accepted papers will be published in the conference proceedings (hard copy
with ISBN number). Selected papers will be considered for publication in
Control & Cybernetics and Fundamenta Informaticae.

Paper Submission:
The working language of the conference is English. Only original, unpublished
papers are invited. Authors should upload an electronic version of the full
paper (pdf and/or possibly ps) by using the conference paper registration and
submission site (the site will be opened soon) before March 1, 2010.

Original papers not exceeding 14 pages are solicited for IIS 2010. The papers
should be organized in accordance with common scientific structure (abstract,
state of the art in the field, intention, used methodology, obtained results and
references). The papers will be refereed by an international committee, and
accepted on the basis of their scientific merit, novelty and relevance to the
conference topics. After notification of acceptance, authors will be allowed to
make a correction in accordance with the suggestions of the reviewers and submit
final camera-ready papers.

<...edited for length...>

Sender: Oscar Cordon <[log in to unmask]>
Subject: IPMU2010 special session on evolutionary algorithms

Organizers: Günther Rudolph, Mike Preuß, Frank Hoffmann

Email contact: [log in to unmask]

Special session URL:

IPMU 2010:

The International Conference on Information Processing and Management of
Uncertainty in Knowledge-Based Systems (IPMU) is organized every two years with
the focus of bringing together scientists working on methods for the management
of uncertainty and aggregation of information in intelligent systems. This
conference provides a medium for the exchange of ideas between theoreticians and
practitioners in these and related areas. In 2010 the conference will be held in
the conference centre ?Westfalenhallen? in Dortmund, a renowned city located in
the Ruhrarea, the former industrial heart of western Germany. The Ruhrarea will
be the European Cultural Capital in 2010, hosting an impressive program of art,
exhibitions, culture, performances and industrial heritage.

Evolutionary algorithms constitute search methods that mimic processes that
occur in natural evolution in order to solve complex optimization problems. A
population of solutions evolves by means of selection, reproduction and
recombination over time. Evolutionary algorithms find solutions in a robust and
efficient manner in optimization problems such as structural optimization,
hardware in the loop optimization, game strategies, combinatorial optimization,
scheduling, artificial life, machine learning, aerodynamic design, control
system design and robotics. The straightforward application of evolutionary
algorithms to real word problems, and in particular evolutionary design of
complex systems, is severely handicapped by vagueness and uncertainty in the
formulations of objectives and constraints, time- or cost-consuming evaluation
of solutions, interconnection of multiple sub-systems and non-stationary
environments. The objective of the special session is to bring together
researchers to report and discuss recent developments, trends and challenges
in evolutionary algorithms including but not limited to these topics.
- genetic algorithms
- evolution strategies
- evolutionary computation in games
- design of experiments
- multi objective evolutionary algorithms
- fuzzy concepts and models in evolutionary algorithms
- vagueness and uncertainty in fitness evaluations
- theoretical foundations of evolutionary algorithms
- model assisted evolutionary algorithms
- estimation of distribution methods
- evolutionary robotics
- genetic fuzzy systems
- evolutionary structural optimization
- development and evolution
- efficient global optimization

In case you intend to submit a paper to the special session please notify the
organizers in advance about the prospective authors and title. When you submit
the paper through the online conference system, please indicate in your
selection that the paper belongs to the special session on ? Evolutionary
Algorithms?. The conference proceedings will be published by Springer-Verlag in
the LNAI/CCIS series.
January 17th, 2010 official deadline for submission of regular papers
February 19th, 2010 extend deadline for submission of papers to special session
March 7th, 2010 notification of acceptance
April 4th, 2010 submission of final version
June 28th ? July 2nd, 2010 conference


 - Send submissions (articles) to [log in to unmask]
  DO NOT send submissions to the [log in to unmask] address.

 - To subscribe send email to [log in to unmask] containing the
  following text in the body of the message:

       subscribe ec-digest-l <Your Name (up to 4 words)>

 - To unsubscribe send email to [log in to unmask] containing the
  following text in the body of the message:

       unsubscribe ec-digest-l

 - To change your email address, simply unsubscribe the old address
  and subscribe the new one.

 - Send other administrative requests to [log in to unmask]

 - For further information about the digest, see


 End of Evolutionary Computation Digest

Top of Message | Previous Page | Permalink

Advanced Options


Log In

Log In

Get Password

Get Password

Search Archives

Search Archives

Subscribe or Unsubscribe

Subscribe or Unsubscribe


August 2021
May 2021
March 2021
January 2021
December 2020
November 2020
October 2020
September 2020
July 2020
June 2020
May 2020
April 2020
February 2020
January 2020
March 2019
February 2019
March 2018
February 2018
January 2018
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
January 2017
December 2016
November 2016
September 2016
July 2016
June 2016
May 2016
April 2016
March 2016
January 2016
September 2015
May 2015
March 2015
October 2014
September 2014
August 2014
June 2013
May 2013
March 2013
February 2013
January 2013
August 2012
June 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
April 2009
March 2009
February 2009
January 2009



CataList Email List Search Powered by the LISTSERV Email List Manager