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  December 2009

EC-DIGEST-L December 2009


EC-Digest v23n11


Adam Campbell <[log in to unmask]>


Evolutionary Computation Digest <[log in to unmask]>


Wed, 2 Dec 2009 23:19:19 -0500





text/plain (878 lines)

Evolutionary Computation Digest Wednesday, December 2, 2009 Volume 23: Issue 11

SUBMISSION ADDRESS:    [log in to unmask]

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


Today's Topics:

    - New Book Announcement
    - Novel Scalable Constrained Problems for CEC 2010 Competition and specia...
    - Fully Funded PhD Scholarships at the University of Birmingham, UK
    - ICML/COLT 2010 Call for Workshop Proposals
    - ICML 2010 Call for Tutorial Proposals
    - GECCO-2010: Call for competitions

    - Call for Papers *** 2010 Genetic and Evolutionary Computation Conference
    - ICNC'10-FSKD'10 Papers Due 15 January: EI Compendex & IEEE Xplore
    - CIGPU 2010 Call For Papers
    - [NatComp'2010] Wksp on Nature..., ACS/IEEE AICCSA 2010: deadline extension
    - Call for papers: Genetic Programming Theory and Practice 2010
    - [Call for Papers] Post-Workshop Proceedings Volume IWLCS 2008/2009
    - CFP: CEC 2010 Special Session on: Niching Methods for Multimodal Optimi...
    - CEC 2010 Special Session & Competition on Large Scale Global Optimization


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

ACAL09, Australian Conference on Artificial Life, Melbourne, Dec 1-4, '09(v23n4)
AI09, Australian Conference on Artifical Intelligence, Melbourne,Dec 1-4 (v23n4)
AI*IA09, Conf. of the Italian Assoc. for AI, Reggio Emilia,Italy,Dec9-11 (v23n7)
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)
ICML-10, Intl Conference on Machine Learning, Haifa, Israel, June 21-25 (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)

  Send announcements of other activities to [log in to unmask]

Sender: [log in to unmask]
Subject: New Book Announcement

It is a pleasure to announce the publication of the book:

Edited by: Carlos A. Coello Coello, Satchidananda Dehuri and Susmita Ghosh
Published by: Springer (Studies in Computational Intelligence
          Series Vol. 242)
          ISBN: 978-3-642-03624-8
          288 pages, 82 illustrations

About this book:
The purpose of this book was to collect contributions that are at the
intersection of multi-objective optimization, swarm intelligence (specifically,
particle swarm optimization and ant colony optimization) and data mining. Such a
collection intends to illustrate the potential of multi-objective swarm
intelligence techniques in data mining, with the aim of motivating more
researchers in evolutionary computation and machine learning to do research in
this field.

This volume consists of eleven chapters, including an introduction that provides
the basic concepts of swarm intelligence techniques and a discussion of their
use in data mining. Some of the research challenges that must be faced when
using swarm intelligence techniques in data mining are also addressed. The rest
of the chapters were contributed by leading researchers, and were organized
according to the steps normally followed in Knowledge Discovery in Databases
(KDD) (i.e., data preprocessing, data mining, and post processing).

We hope that this book becomes a valuable reference for those wishing to do
research on the use of multi-objective swarm intelligence techniques in data
mining and knowledge discovery in databases.

Written for:
Researchers, engineers, graduate students in computational intelligence,
computer science, swarm intelligence

   * Computational Intelligence
   * Data Mining
   * Multi-Objective Problems
   * Swarm Intelligence

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

"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

Competition & Special Session on Constrained Numerical Optimization @ CEC10,
Barcelona, Spain, July 18-23

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
     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: Xin Yao <[log in to unmask]>
Subject: Fully Funded PhD Scholarships at the University of Birmingham, UK

Postgraduate Elite Scholarships
College of Engineering and Physical Sciences
(Deadline: 31 December 2009)

Outstanding overseas (non-EU) applicants are invited for Postgraduate Elite
Scholarships in the College of Engineering and Physical Sciences, the University
of Birmingham, UK. These highly competitive Scholarships can be taken up in the
School of Computer Science. We are particularly keen on receiving applications
in evolutionary computation and host them in the Natural Computation Group and

The Scholarships are very generous:
   * The Scholarships are awarded for a period of 3.5 years;
   * The Scholarships are expected to begin in September of the first year of
     the award (but the start date is negotiable);
   * The Scholarship covers the full rate of overseas fees;
   * The Scholarship will pay a maintenance award set at standard research
     council rates; (At least £13000 pa tax-free)
   * The Scholarship will pay a single £5000 research grant which can be spent
     on research related costs (travel, conferences, books, computing equipment
     etc) over the period of the award.

Of course, the Scholarships are extremely competitive. We expect the successful
applicants to be among the top three of his/her year in his/her department from
a good university or having an excellent research track record (evidenced by
publications) already.

For more information about the Scholarships, please visit:

For applications to do a PhD in Evolutionary Computation, visit the School of
Computer Science page:
and follow How-to-Apply instructions there.

For research in evolutionary computation, see CERCIA (
and the Natural Computation Group

Dr. John Bullinaria (
Dr. Jon Rowe (
Prof. Xin Yao (

Sender: Johannes Fuernkranz <[log in to unmask]>
Subject: ICML/COLT 2010 Call for Workshop Proposals

This is a call for workshop proposals for ICML & COLT 2010 in Haifa, Israel
( and The workshop will take
place on June 25, in between ICML June 21-24 and COLT June 27-29. This two day
slot presents an excellent opportunity for you to organize a workshop on the
machine learning-related topic of your choice.

Workshop day:             June 25, 2010, Haifa, Israel
Proposal deadline:        Monday, January 18, 2010
Acceptance notification:  Monday, February 8, 2010

Workshops are a great format for active research on new topics. The ideal
workshop covers a compelling subject of current or upcoming research, and
includes an impressive set of speakers with diverse backgrounds to discuss the
subject. Discussion via panels, identification of open problems, or a
"discussant" are all great components to include.

The format, style, and content of accepted workshops is under the control of the
workshop organizers and largely autonomous from the main conferences. The
workshops can be up to seven hours long, split into morning and afternoon
sessions. Workshop organizers are expected to manage the workshop content,
specify the workshop format, be present to moderate the discussion and panels,
invite experts in the domain, and maintain a website for the workshop. Workshop
registration will be handled centrally by the main conference with a single
uniform registration fee and with registrants allowed to attend workshops other
than the one they register for.

Submission Instructions:
Proposals should specify clearly all of the following:
   * Workshop title (what is it called?)
   * Topic (what is it about?)
   * Motivation (why a workshop on this topic?)
   * Impact and expected outcomes (what will having the workshop do?)
   * Potential list of invited speakers (who might come?)
   * List of related publications (where can we learn more?)
   * Main workshop organizer (who is making it happen?)
   * Other organizers (who else is making it happen?)
   * Bio for each organizer (who are you?)
   * Workshop URL (where will interested parties get more information?)
   * Relevant conferences (which of ICML and COLT would it appeal to?)

This information should be sent by email (in plain text or pdf format)
to [log in to unmask] by January 18.

Sender: Johannes Fuernkranz <[log in to unmask]>
Subject: ICML 2010 Call for Tutorial Proposals

The ICML-2010 Organizing Committee invites proposals for tutorials to be held at
the 27th International Conference on Machine Learning, on Monday, June 21, 2010
in Haifa, Israel (

We seek proposals for tutorials on core techniques and areas of knowledge that
enjoy broad interest within the machine learning community. We are interested in
tutorials on established or emerging research topics within the field itself,
but we also welcome tutorials from related research fields or application areas
provided that they are of sufficient interest to the machine learning community.
The ideal tutorial should attract a wide audience. It should be broad enough to
provide a gentle introduction to the chosen research area, but it should also
cover the most important contributions in depth. Proposals that exclusively
focus on the presenters' own work or commercial presentations are not eligible.

Guidelines for preparing a proposal can be found at:

Tutorial proposals should be submitted via email in PDF format to
[log in to unmask] . Soon after submission, proposers should expect to
receive a verification of receipt.

The timeline is as follows:
  * Tutorial proposals due: February 13, 2010
  * Acceptance notification: February 28, 2010
  * Website due: March 15, 2010
  * Tutorial material due: May 30, 2010
  * Tutorials date: June 21, 2010

Sender: Christian Gagné <[log in to unmask]>
Subject: GECCO-2010: Call for competitions

                         CALL FOR COMPETITIONS
                        Sponsored by ACM SIGEVO

The GECCO-2010 Program Committee invites proposals for competitions to be held
in conjunction with the 2010 Genetic and Evolutionary Computation Conference
(GECCO-2010) in Portland, Oregon, USA, July 7-11.

These are competitions that would be open to anyone attending the conference,
and would be on a topic of interest covered by the event. Even though nominal
prizes will be awarded, the main purpose of these competitions will be
recognition of scientific, technical and/or artistic excellence by the

A special session on competitions will be held during the GECCO-2010, with
presentation of different competitions and associated submissions. Nominal
prizes will be awarded at the SIGEVO meeting ceremony, to be held on
July 11th, 2010 (provisional planning).

Competition organizers should prepare a proposal that includes:
* Description of the problem addressed;
* Description of the data and a web link for downloads;
* Evaluation procedures and established baselines;
* Estimation of the number of participants;
* Possible sources of sponsorship, if any;
* Short bios of the proposers, including experience in similar events.

Please submit your proposals to the GECCO-2010 Competition Chair:
Christian Gagne, Laval University, Quebec City, Canada
[log in to unmask]

Proposals should be submitted on or before the deadline of:
** January 22nd, 2010 **

Competitions will be posted on the GECCO-2010 Web site as they are approved.

Sender: Pier Luca Lanzi <[log in to unmask]>
Subject: Call for Papers *** 2010 Genetic and Evolutionary Computation
         Conference (GECCO-2010)

    2010 Genetic and Evolutionary Computation Conference (GECCO-2010)
                   July 7-11, 2010 (Wednesday-Sunday)
                         Portland, Oregon, USA
                        Organized by ACM SIGEVO
    19th International Conference on Genetic Algorithms (ICGA) and the
            15th Annual Genetic Programming Conference (GP)
       One Conference - Many Mini-Conferences - 15 Program Tracks

The Genetic and Evolutionary Computation Conference (GECCO-2010) will present
the latest high-quality results in the growing field of genetic and evolutionary

Topics include: genetic algorithms, genetic programming, evolution strategies,
evolutionary programming, real-world applications, learning classifier systems
and other genetics-based machine learning, evolvable hardware, artificial life,
adaptive behavior, ant colony optimization, swarm intelligence, biological
applications, evolutionary robotics, coevolution, artificial immune systems,
and more.

* 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

* Calendar (ical format):
* Updates:


* To propose a tutorial, contact Una-May O Reilly at [log in to unmask]
* To propose a workshop, contact Jaume Bacardit at [log in to unmask]

Please include GECCO in your subject line.

The Portland Marriott Downtown Waterfront Hotel, located in downtown Portland,
is near the Portland Riverplace Marina, restaurants, shopping & performing arts

Visit for information about electronic
submission procedures, formatting details, student travel grants,
the latest list of tutorials and workshop, late-breaking papers, and

Conference updates are also posted on Twitter at

For technical matters, contact Conference Chair Martin Pelikan at
[log in to unmask]

For conference administration matters contact submit your questions to
the moderated comment system at:

Sender: ICNC'10-FSKD'10 <[log in to unmask]>
Subject: ICNC'10-FSKD'10 Papers Due 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), foreign experts
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. 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]

Sender: Tony Lewis <[log in to unmask]>
Subject: CIGPU 2010 Call For Papers

Special session:
Computational Intelligence on Consumer Games and Graphics Hardware (CIGPU 2010)

As part of:
IEEE World Congress on Computational Intelligence Conference 2010 (WCCI-2010)

The remarkable speed and price benefits of applying massively parallel graphics
hardware, such as the GPU, to scientific computing tasks are becoming much more
widely known and are attracting a great deal of interest.  In computational
intelligence (CI), there have already been impressive demonstrations of the
power of this technology but the research area is still developing rapidly.
There is much work to be done on questions such as how to make this raw power
easily accessible for general CI research, how to apply it to new CI fields
and how to continue to get the most out of it as the technology develops.
There is also increasing interest in the use of related technologies found in
game consoles such as Microsoft's Xbox, Sony's Playstation and the Cell
processor, and in portable entertainment and cellular phone mobile devices.

Building on the success of previous CIGPU sessions and workshops, CIGPU 2010
will further explore the role that these technologies can play in CI research.
Submissions of original research are invited on the use of parallel graphics
hardware for computational intelligence.  Work might involve exploring new
techniques for exploiting the hardware, new algorithms to implement on the
hardware, new applications for accelerated CI, new ways of making the
technology available to CI researchers or the utilisation of the next
generation of technologies.

Anyone who has implemented any computational intelligence technique using any
parallel graphics hardware (or related - see below) will want to submit to this
special session.

Examples of appropriate platforms and types of hardware include but are not
limited to :
 * Graphics cards and GPGPU platforms (such as CUDA, OpenCL etc)
 * Portable devices (such as cell phones, PDA etc)
 * Gaming consoles and their processors (such as Playstation (and the Cell),
   Xbox etc)
 * Larrabee
 * Other mass market parallel electronic hardware

Examples of appropriate CI techniques include but are not limited to :
 * Artificial Neural Networks
 * Bayesian Networks
 * Computational Biology or Bioinformatics
 * Classification
 * Data mining
 * Differential Evolution
 * Evolutionary Computation (such as genetic programming, genetic algorithms,
   evolutionary programming etc)
 * Fuzzy Logic
 * Hybrid computational intelligence techniques
 * Parallel search algorithms
 * Robotics
 * Support Vector Machines

Special Session Website

Submission deadline: 31st January 2010
Page limit: 8 pages.
Please see the WCCI 2010 site ( from more details.

Sender: Laetitia Jourdan <[log in to unmask]>
Subject: [NatComp'2010] Workshop on Nature Inspired Computing, ACS/IEEE
         AICCSA 2010: deadline extension

Workshop on Nature Inspired Computing (NATComp'2010) as a part of 2010 ACS/IEEE
International Conference on Computer Systems and Applications HAMMAMET TUNISIA
May 16-19th, 2010

* Full Paper Submission Deadline ------------- December 30, 2009
* Notification of Acceptance -------------------- January 15, 2010
* Camera-Ready papers Due ------------------- February 5, 2010
* Author Registration ---------------------------- February 5, 2010
* Workshop ---------------------------------May 16-19, 2010

We would like to draw your attention to the Workshop on Nature Inspired
Computing (NATComp'2010), which has currently an open call for papers.
NATComp'2010 will be held in Hammamet, Tunisia, next May 16-19th 2010
as a part of ACS/IEEE International Conference on Computer Systems and
Applications (

Nature inspired computing is a field that studies and creates innovating
computing algorithms inspired by nature principle. The goal is to benefit from
the robustness, decentralized and parallel properties coming from nature to
solve new large and complex problems.

The papers are solicited in the following (but not limited) Areas:
* Evolutionary algorithms, swarm optimization, scatter search, …
* Emergent nature inspired algorithms: quantum computing,
  artificial immune systems, bee colony, DNA computing, …
* Parallel algorithms and hybrid methods with metaheuristics,
  machine learning, game theory, mathematical programming, constraint
  programming, co-evolutionary, …
* Artificial Neural Networks
* Biodegradability Prediction
* Cellular Automata
* Nano Computing
* Application to: logistics and transportation,
  telecommunications, scheduling, data mining, engineering design,
  bioinformatics, …
* Theory of metaheuristics, landscape analysis, convergence,
problem difficulty, very large neighbourhoods, …
* Application to multi-objective optimization
* Application in dynamic optimization, problems with uncertainty, …

All submitted papers will be blind reviewed by at least two reviewers. Selection
criteria will be based on relevance, originality, significance, impact,
technical soundness and quality of the presentation.

Submissions should not exceed 8 two columns, 8.5x11 inch pages (including
figures, tables, and references) in 10 point fonts. IEEE templates are available
at the url

Sender: Rick Riolo <[log in to unmask]>
Subject: Call for papers: Genetic Programming Theory and Practice 2010

The Center for the Study of Complex Systems (CSCS) at the University
of Michigan is pleased to be hosting:

  GPTP-2010 -- Eighth Annual Genetic Programming Theory and Practice Workshop
  May 20-22 (Thur-Sat), 2010
  Ann Arbor Michigan USA

GPTP is a small, one-track, invitation-only workshop devoted to the integration
of theory and practice. In particular, it focuses on how theory can inform
practice and what practice reveals about theory.

If you are interested in presenting a paper at GPTP-2010, we ask you to submit
an extended abstract describing your work and results. We will extend a limited
number of invitations based on proposed abstracts.

We encourage our contributors to submit work that asks new questions about GP
and its application, and finds creative ways to address those questions. We
encourage presentation of results that
   * highlight a qualitative new understanding of some GP issue along with
     empirical evidence;
   * demonstrate a qualitatively new GP application; or
   * show substantive (2 to 10x!) improvements in speed, reliability, results
     quality, etc.

The goal is to continue to make GPTP workshops a leading venue for high quality,
cutting-edge work for progress toward a science of GP.

To see a list of participants and papers for previous GPTP workshops, visit

Papers have been published in a series of "Genetic Programming Theory and
Practice" books, one for each year (by Kluwer/Springer).

The format of GPTP 2010 will be similar to that of the previous ones
(2003-2009): a relatively small, invitation-only workshop on the campus of the
University of Michigan in Ann Arbor, with plenty of time for discussion of a
roughly equal mix of a total of 18 papers by theorists and practitioners. In
order to facilitate a substantial exchange of ideas, workshop talks will be
approximately 30 minutes long, with considerable time allocated for discussion.
The papers will be reviewed by co-participants prior to the workshop, and
collected for publication in a book to be published as soon as possible after
the workshop. As we would like to have the papers available for distribution
before the workshop, the deadline for the submission of full papers will be
mid/late March 2010. Papers will be 16 pages max.

If you are interested in having a paper considered for presentation at the
workshop and included in the book, please send a one-page abstract as well as a
short CV of the authors to: [log in to unmask]
by: 11 January 2010. *** Earlier responses are encouraged ***

The abstracts will be reviewed and decisions made by 18 January 2010. We will
select 2-6 proposed papers based on relevance to the GPTP workshop goals, the
expected quality of the contribution, and how the paper topic will fit with the
"mix" of other invited and selected papers.

There is no "workshop fee" for participation, as workshop is funded by generous
donations from groups and companies interested in advancing the art and science
of GP.

If you have questions, please email them to [log in to unmask]

Sender: Jaume Bacardit <[log in to unmask]>
Subject: [Call for Papers] Post-Workshop Proceedings Volume IWLCS 2008/2009

International Workshop on Learning Classifier Systems
Call for Papers - Post-Workshop Proceedings Volume IWLCS 2008/2009
Submission deadline: February 19, 2010

A Compilation of two exciting workshop years - IWLCS 2008 / 2009.
Current advances and future outlooks.

Since Learning Classifier Systems (LCSs) were introduced by Holland (1977) as a
way of applying evolutionary computation to machine learning problems, the LCS
paradigm has broadened greatly into a framework encompassing many
representations, rule discovery mechanisms, and credit assignment schemes.
Current LCS applications range from data mining to automated innovation to
on-line cognitive control. Classifier systems are a very active area of
research, with newer approaches, in particular Wilson's linear
approximation-based XCSF (Wilson, 2002), receiving a great deal of attention.
LCS are also benefiting from advances in the field of reinforcement learning,
adaptive filtering, and machine learning. Novel insights in these two areas are
continuously integrated into the LCS framework.

For the post-workshop proceedings volume, we invite submissions of extended
versions of the workshop contributions as well as additional contributions that
survey state-of-the art advances, cutting edge research in the field, as well as
future outlooks following on from workshop discussions. The volume will comprise
recent developments in all areas of research on, and applications of, Learning
Classifier Systems.

* Submission Format
Submitted papers (deadline February 19, 2010) should have a maximum length of
twenty (20) pages in 10pt, one-column format. Please use the LNCS
Springer-Verlag style as specified at
(LATEX utilities can be found in the file Papers will be reviewed
for acceptance by the program committee and the organizers to ensure highest
possible post-workshop proceedings quality.

All papers should be submitted, providing both source and a printable
version in PDF format, using the online submission system at

* Important dates
* Paper submission deadline: Friday, February 19, 2010
* Notification to authors: Friday, March 25, 2010
* LNCS Post-workshop proceedings camera-ready material: by Friday,April 22, 2010
* Estimated publication of volume: Around IWLCS 2010

For more details, please visit the workshop website at:

Sender: Xiaodong Li <[log in to unmask]>
Subject: CFP: CEC 2010 Special Session on: Niching Methods for Multimodal

2010 IEEE Congress on Evolutionary Computation Special Session on:
Niching Methods for Multimodal Optimization
July 18 - 23, 2010, Barcelona, Spain

Evolutionary Algorithms (EAs) in their original forms are usually designed for
locating a single global solution. These algorithms typically converge to a
single solution because of the global selection scheme used. Nevertheless, many
real-world problems are “multimodal” by nature, i.e., multiple satisfactory
solutions exist. It may be desirable to locate many such satisfactory solutions
so that a decision maker can choose one that is most proper in his/her problem
domain. Numerous techniques have been developed in the past for locating
multiple optima (global or local). These techniques are commonly referred to as
“niching” methods. A niching method can be\ incorporated into a standard EA to
promote and maintain formation of multiple stable subpopulations within a single
population, with an aim to locate multiple globally optimal or suboptimal
solutions. Many niching methods have been developed in the past, including
crowding, fitness sharing, derating, restricted tournament selection, clearing,
speciation, etc.

Most of existing niching methods, however, have difficulties which need to be
overcome before they can be applied successfully to real-world multimodal
problems. Some identified issues include: difficulties to pre-specify some
niching parameters; difficulties in maintaining found solutions in a run; extra
computational overhead; poor scalability when dimensionality is high. This
special session aims to highlight the latest developments in niching methods,
bring together researchers from academia and industries, and explore future
research directions on this topic. We invite authors to submit original and
unpublished work on niching methods. Topics of interest include but are not
limited to:
- Theoretical developments in multimodal optimization
- Niching methods that incurs lower computational costs
- Handling the issue of niching parameters in niching methods
- Handling the scalability issue in niching methods
- Handling problems characterized by massive multi-modality
- Adaptive or parameter-less niching methods
- Multiobjective approaches to niching
- Multimodal optimization in dynamic environments
- Niching methods applied to discrete multimodal optimization problems
- Niching methods applied to constrained multimodal optimization problems
- Niching methods using parallel or distributed computing techniques
- Benchmarking niching methods, including test problem design and performance
- Comparative studies of various niching methods
- Niching methods applied to engineering and other real-world multimodal
  optimization problems

Please note that we are NOT interested if the adopted task is to find a single
solution of a multimodal problem.

Manuscripts should be prepared according to the standard format and page limit
of regular papers specified in CEC2010 and submitted through the website Special session papers will be treated in the same way
as regular papers and included in the conference proceedings

Paper Submission: 31 January 2010
Decision Notification: 15 March 2010
Final Camera-Ready Submission: 2 May 2010

For general enquiries, please contact Xiaodong Li via email:
[log in to unmask]

Sender: Ponnuthurai Nagaratnam Suganthan (Assoc Prof) <[log in to unmask]>
Subject: CEC 2010 Special Session & Competition on Large Scale Global

Call for Papers and Participations
CEC 2010 Special Session on Large Scale Global Optimization
CEC 2010 Competition on High-dimensional Numerical Optimization

In the past two decades, different kinds of nature-inspired optimization
algorithms have been developed and applied to solve optimization problems,
including Simulated Annealing (SA), Evolutionary Algorithms (EAs), Differential
Evolution (DE), Particle Swarm Optimization (PSO), Ant Colony Optimization
(ACO), Estimation of Distribution Algorithms (EDA), etc. Although these
approaches have shown excellent search abilities when applying to some small or
medium size problems, many of them will encounter severe difficulties when
applying to large scale problems, e.g., problems with up to 1000 variables. The
reasons appear to be two-fold. First, the complexity of a problem usually
increases with the number of decision variables, number of constraints, or even
number of objectives (for multi-objective optimization). This emergent
complexity might prevent a previously successful search strategy from finding
the optimal solution. Second, the solution space of the problem increases
exponentially with the number of decision variables, and a more efficient search
strategy is required to explore all the promising regions with limited
computational resources.

Historically, scaling up EAs to large scale problems has attracted much
interest, including both theoretical and practical studies. However, existing
work in the areas of EAs are still limited given the significance of the
scalability issue. Due to this fact, this special session is devoted to
highlight the recent advances in EAs for large scale optimization problems,
involving single objective or multiple objectives, unconstrained or
constrained problems, binary or discrete or real or mixed decision variables.
Specifically, we encourage interested researchers to submit their latest work on
* Both theoretical and experimental analysis of the scalability of EAs.
* Novel approaches and algorithms for scaling up EAs to large scale optimization
* Applications of EAs to real-world large scale optimization problems.
* Papers on novel test suites that help us in understanding problem
  characteristics are also welcome.

A competition on High-dimensional Numerical Optimization will also be organized
in company with our special session. The competition allows participants to run
their own algorithms on 20 benchmark functions, each of which is of 1000
dimensions. The purpose of this competition is to compare different algorithm on
the exactly same platform. The experiments will take about 205 hours with the
Matlab version on a PC with 2.40GHz CPU, and 104 hours with the Java version on
a PC with 2.2GHz CPU. Each participant (or research group) is invited to submit
a paper to the special session to present their algorithm as well as the results
obtained. Details of the set of scalable functions and requirements on the
simulation procedure can be found at the webpage of the special session:

Researchers are welcome to apply any kind of computational intelligence
approaches (e.g. EAs, Neural Nets, fuzzy-based methods) to the test suite. The
results of this competition will be archived on our web pages as done for the
CEC 2008 competition on High-dimensional Function Optimization.

Important Dates
Paper Submission: January 31, 2010
Acceptance Notification: March 15, 2010
Final Manuscript Due: May 2, 2010
For latest news, please refer to

Paper Submission
Manuscripts should be prepared according to the standard format and page limit
specified in CEC 2010. For more submission instructions, please see the WCCI
submission page at:

All special session papers will be treated in the same way as regular papers.
All papers accepted by the special session will be included in the CEC 2010
conference proceedings and selected authors will be invited to present their
results during WCCI 2010.

When submitting, please make sure you have chosen "S01: Large Scale Global
Optimization" as the "Main Research Topic".


 - 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