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  September 2010

EC-DIGEST-L September 2010


EC-Digest v24n9


Adam Campbell <[log in to unmask]>


Evolutionary Computation Digest <[log in to unmask]>


Tue, 7 Sep 2010 23:42:04 -0400





text/plain (582 lines)

Evolutionary Computation Digest Tuesday, September 7, 2010 Volume 24: Issue 9

SUBMISSION ADDRESS:    [log in to unmask]

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


Today's Topics:

 - CFP for a special issue of GPEM on Genetic Algorithms for Data Mining
 - [CFP] A Special Issue on Emerging Synergies of Artificial Intelligence and...
 - Call for Papers: Machine Learning in Online ADvertising (MLOAD)
 - Deadline extension - ECJ special issue on BBO Benchmarking - end of September
 - EvoSTIM 2011 - CfP
 - evostar 2011: Call For Papers
 - CfP: EvoHOT 2011


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

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)
PABA'10,3rd WKSP on Parallel Arch. and Bio...,Vienna, Austria,Sep11-15'10(v24n6)
AIAI 2010,6th IFIP Conf on AI Applicatio..., Ayia Napa, Cyprus, Oct5-7'10(v24n7)
META'10,Intl. Conf. on Meta. and Nature ..., Djerba, Tunisia,Oct28-30'10 (v24n5)
BIONETICS'10,5th Intl ICST Conf on Bio-Inspi...,Boston, MA, USA,Dec1-3'10(v24n6)
NaBIC'10,2nd World Congress on Nature ..., Kitakyushu, Japan,Dec 15-17'10(v24n6)
SEMCCO'10,Intl Conf on Swarm, Evolut..., Chennai, India, Dec. 16-18, 2010(v24n6)
FOGA'11,Foundations of Gen. Alg. XI, Schwarzenberg, Austria, Jan 5-9 2011(v24n3)
ACM-SAC11,26th ACM Symp Applied Comp EC Track,TaiChung Taiwan,Mar21-25'11(v24n7)
IEEE SDE'11,IEEE Symp on Differential Evolution,Paris, France,Apr11-15'11(v24n6)
ICANNGA'11,Intl Conf. on Adaptive and ...,Ljubljana, Slovenia,Apr14-16'11(v24n6)
EVO*'11, The main European events on EC, Torino, Italy, April 27-29, 2011(v24n9)
GECCO'11,Genetic and Evol Comp Conference, Dublin, Ireland,July 12-16 '11(v24n7)

Sender: Pierre Collet <[log in to unmask]>
Subject: CFP for a special issue of GPEM on Genetic Algorithms for Data Mining

Journal: Genetic Programming and Evolvable Machines (pub. by Springer)
Guest Editors: Pierre Collet, Université de Strasbourg, France;
              Man Leung Wong, Lingnan University, Hong Kong
Editor-in-Chief: Lee Spector, Hampshire College

The corporate and scientific communities are overwhelmed with an influx of data
that is stored in on-line databases. Analyzing these data and extracting
meaningful information in a timely fashion is intractable without computer
assistance and powerful analytical tools. Data Mining is defined as the
non-trivial process of identifying valid, novel, potentially useful, and
ultimately understandable patterns in data stored in databases
(Fayyad et al. 1996). It is an active research area with promise for high
payoffs in many business and scientific applications including direct marketing,
trend analysis, fraud detection, stock price forecasting, option trading, bond
rating, portfolio management, shopping patterns analysis, and medical diagnosis
(Simoudis et al. 1996, Groth 1998).

The future of scientific computing is parallel and Artificial Evolution is
inherently parallel. Therefore, all the recent successes in Data Mining obtained
using Genetic Programming, Genetic Algorithms, Evolutionary Programming,
Evolution Strategies, etc. bear a great potential. The grand challenge of using
Evolutionary Algorithms for Data Mining is to automatically process large
quantities of raw incomplete data with noisy information, identify the most
significant and meaningful information/knowledge and present it for achieving
the user's goals.

The aim of this special issue is to provide authors with a possibility to
publish their work in a renowned journal and the reader with an understanding of
the grand challenge, novel approaches in tackling the grand challenge, and some
real-life applications, be they already parallelized or not.

We encourage submission of high quality papers (original work that has neither
appeared in, nor is under consideration by, other journals), both theoretical
and empirical, discussing novel Evolutionary Algorithms for Data Mining.
Practical papers that describe successful applications of Evolutionary
Algorithms for challenging real-life data mining problems are also sought.
Subjects will include (but are not limited to):
- Parallel evolutionary algorithms for data mining
- Data mining from incomplete, imprecise, noisy, imbalanced, and huge databases
- Evolutionary algorithms for cost-sensitive data mining
- Evolutionary ensemble techniques for data mining
- Evolutionary algorithms for supervised and unsupervised classification of data

We encourage all prospective authors to contact the guest editors, at the
address below, as early as possible, to indicate your intention to submit a
paper to this special issue.

Authors are encouraged to submit high-quality, original work that has neither
appeared in, nor is under consideration by, other journals.

Manuscripts should be submitted to: Choose "Evol.
Algorithms for Data Mining" as the article type when submitting.

Springer offers authors, editors and reviewers of Genetic Programming and
Evolvable Machines a web-enabled online manuscript submission and review system.
Our online system offers authors the ability to track the review process of
their manuscript with straightforward log-in and submission procedures, and it
supports a wide range of submission file formats.

== Important Dates:
Paper submission deadline: Dec 15, 2010
First Notification: March 15, 2011
Final manuscript: April 30, 2011

<... edited for length ...>

Sender: Shih-Hsi "Alex" Liu <[log in to unmask]>
Subject: [CFP] A Special Issue on Emerging Synergies of Artificial Intelligence
         and Software Engineering, IJSEKE

A Special Issue on Emerging Synergies of Artificial Intelligence and Software
Engineering International Journal of Software Engineering and Knowledge

=== Theme ===
As software engineering is requested to answer dynamic, automated, adaptive,
optimal and/or large-scale demands, other computer science disciplines come to
play. Artificial Intelligence is one of them that may bring software engineering
into further height. Conversely, software engineering techniques also play an
important role to alleviate development cost and time of AI techniques as well
as assist in introducing new AI techniques. Such mutually beneficial
characteristics have appeared in the past few decades and still evolved due to
new challenges. Several exemplified challenges include, but not limited to, how
machine learning addresses software optimization problems derived from new
software approaches (e.g., model-driven engineering, service-oriented computing,
and cloud computing); and conversely how these new software approaches may help
develop artificial intelligence-related software environments.

A special issue on Emerging Synergies of Artificial Intelligence and Software
Engineering of the International Journal of Software Engineering and Knowledge
Engineering will devote to the latest innovative “synergistic” AI and software
engineering techniques/practices to the aforementioned challenges. Namely, we
are interested in new and novel AI solutions to software engineering challenges,
software engineering practices to answer AI obstacles, and techniques that could
benefit these realms bi-directionally.

The special issue seeks high-quality original and unpublished papers in the
following topics including but not limited to these topics:
* AI techniques for optimization, transformation, and configuration management
* AI techniques for software reuse, evolution, maintenance and refactoring
* AI techniques for ontology and other semantic aspects in software engineering
* AI techniques for business process management and business rules
* AI techniques for reverse engineering and program understanding
* AI techniques for aspect mining and pattern mining
* AI techniques for testing and quality assurance
* AI techniques for performance engineering (e.g., performance approximation,
  monitoring, and adaptation)
* AI techniques for software specification, design, integration and requirement
* AI techniques for software analysis and validation
* AI techniques for cost analysis and risk assessment in software projects
* Agent-based software engineering
* Visual modeling and model-driven development for AI techniques
* Domain modeling and software language engineering (e.g., domain-specific
  languages) for AI techniques
* Service-oriented computing and Cloud computing for AI-based
* Object-oriented and aspect-oriented frameworks to implement and evaluate AI
* Formal methods for AI techniques
* Rapid prototyping and scripting for AI techniques
* Software for knowledge acquisition and representation
* Software metrics applied to AI techniques
* Search engines in AI
* User interfaces for AI techniques

AI techniques of interest include (but are not limited to):
* Machine Learning (unsupervised and supervised learning), Evolutionary
  Algorithms (e.g. GA, GP, ES), Swarm Intelligence, Simulated Annealing, Tabu
  Search, Probabilistic Reasoning, Fuzzy Logic, Neural Networks, Petri Nets,
  Data Mining, Game Theory, Time Series Analysis, Logic and reasoning, Knowledge
  representation, AI planning, among others.

=== Important Dates ===
Paper submission due: February 15, 2011
Notification due: June 1, 2011
Revised paper submission due: August 15, 2011
Final notification: September 30, 2011
Camera-version due: October 15, 2011
Tentative publication date: February, 2012

=== Paper Preparation/Submission Guidelines ===
Paper preparation/submission instructions can be found at

<... edited for length ...>

Sender: Dr. James G. Shanahan <[log in to unmask]>
Subject: Call for Papers: Machine Learning in Online ADvertising (MLOAD)

NIPS 2010 Workshop on Machine Learning in Online ADvertising (MLOAD)
December 10, 2010, Whistler, B.C. Canada

Submission deadline:          Oct. 23, 2010
Notification of Acceptance:  Nov. 11, 2010
Camera ready:                    Nov. 22, 2010
Workshop Date:                  Dec. 10/11, 2010

Online advertising, a form of advertising that utilizes the Internet and World
Wide Web to deliver marketing messages and attract customers, has seen
exponential growth since its inception over 15 years ago, resulting in a
$65 billion market worldwide in 2008; it has been pivotal to the success of the
World Wide Web. This success has arisen largely from the transformation of the
advertising industry from a low-tech, human intensive, “Mad Men”
(ref. HBO TV Series) way of doing work (that were common place for much of the
20th century and the early days of online advertising) to highly optimized,
mathematical, machine learning-centric processes (some of which have been
adapted from Wall Street) that form the backbone of many current online
advertising systems.

The dramatic growth of online advertising poses great challenges to the machine
learning research community and calls for new technologies to be developed.
Online advertising is a complex problem, especially from machine learning point
of view. It contains multiple parties (i.e., advertisers, users, publishers,
and ad platforms such as ad exchanges), which interact with each other
harmoniously but exhibit a conflict of interest when it comes to risk and
revenue objectives.  It is highly dynamic in terms of the rapid change of user
information needs, non-stationary bids of advertisers, and the frequent
modifications of ads campaigns. It is very large scale, with billions of
keywords, tens of millions of ads, billions of users,  millions of advertisers
where events such as clicks and actions can be extremely rare. In addition, the
field lies at intersection of machine learning, economics, optimization,
distributed systems and information science all very advanced and complex fields
in their own right. For such a complex problem, conventional machine learning
technologies and evaluation methodologies are not be sufficient, and the
development of new algorithms and theories is sorely needed.

The goal of this workshop is to overview the state of the art in online
advertising, and to discuss future directions and challenges in research and
development, from a machine learning point of view. We expect the workshop to
help develop a community of researchers who are interested in this area, and
yield future collaboration and exchanges.

Possible topics include:
1) Dynamic/non-stationary/online learning algorithms for online advertising
2) Large scale machine learning for online advertising
3) Learning theory for online advertising
4) Learning to rank for ads display
5) Auction mechanism design for paid search
6)social network advertising and micro-blog advertising
7) System modeling for ad platform
8) Traffic and click through rate prediction
9) Bids optimization
10) Metrics and evaluation
11) Yield optimization
12) Behavioral targeting modeling
13) Click fraud detection
14) Privacy in advertising
15) Crowd sourcing and inference
16) Mobile advertising and social advertising
17) Public datasets creation for research on online advertising

The above list is not exhaustive, and we welcome submissions on highly
related topics too.

Submissions to the MLOAD workshop should be in the format of extended abstracts;
4-6 pages formatted in the NIPS style. The submission does not need to be
blind.  Please upload submissions in PDF to
Accepted extended abstracts will be made available online at the workshop
website. In addition, we plan to invite extended versions of selected papers for
a special issue of a top-tier machine learning or information retrieval journal
(under discussion).

MLOAD CONTACT: Jimi Shanahan; James_DOT_Shanahan_AT_gmail_DOT_com

<... edited for length ...>

Sender: Anne Auger <[log in to unmask]>
Subject: Deadline extension - ECJ special issue on BBO Benchmarking
         - end of September

Guest Editors: Anne Auger, Nikolaus Hansen, Marc Schoenauer

Scope: Quantifying and comparing performance of optimization algorithms is one
important aspect of research in search and optimization. Because this task is
tedious and difficult to realize, the platform COCO (COmparing Continuous
Optimizers) provides most of this tedious task for real-parameter optimization,
namely (1) the choice and implementation of well-motivated single-objective
noise-free and noisy benchmark functions, (2) a sound experimental setup,
(3) the tools to generate data output and post-process the data. The platform
were used for two workshops on Black-Box Optimization Benchmarking (BBOB) at the
Genetic and Evolutionary Computation Conference (GECCO) in 2009 and 2010

Following the two BBOB workshops, we invite participants and other researchers
to submit their original work on benchmarking optimizers for real-parameter
black-box optimization for an ECJ special issue. Submissions can be extensions
of works submitted at the workshops or new submissions. They should be original
research which is not published nor currently under review by other journals or

Topics of interest include (but are not limited to):
  * benchmarking results for new or not-so-new optimization algorithms
    (stochastic, deterministic, ...) for noise-free problems and / or
    noisy problems
  * comparison of optimization algorithms
  * design of benchmarking procedures

Researchers are welcome to use the COCO software platform as well as all data
collected during the two workshops.
Supporting material and a LaTeX-format ECJ style template that includes graphs
and tables generated by the COCO tools are available. See

*Submission:* Authors should submit their manuscripts to the Evolutionary
Computation Journal editorial manager at When submitting a
manuscript, at the same time an email should be sent to Anne Auger
([log in to unmask]) with copy to [log in to unmask] mentioning the special
issue, paper title and authors to confirm the submission.

Sender: A. Sima Etaner-Uyar <[log in to unmask]>
Subject: EvoSTIM 2011 - CfP

Submission Deadline: 22 November 2010

EvoSTIM 2011: 6th European Event on Nature-inspired Techniques in Scheduling,
              Planning and Timetabling
Torino, Italy, 27-29th April 2010

Scheduling, planning and timetabling problems are amongst the most successful
applications of evolutionary techniques to date. A range of representations and
operators may be applied to a wide spectrum of problems in this area. As this is
a mature area, papers building on previous work and case studies on the
acceptance and implementation of evolutionary scheduling, planning and
timetabling systems in the real-world are welcome.  EvoSTIM2011 represents an
opportunity for evolutionary computing researchers in the inter-related areas of
planning, scheduling and timetabling to come together, present their latest
research and discuss current developments and applications.

Topics of interest include, but are not limited to:
- case studies of applications of evolutionary techniques to real-life problems
  in scheduling, timetabling, and planning
- theoretical developments, including benchmarking and other comparative studies
- hybrid methods and novel heuristics
- methods for fast and minimally  disruptive rescheduling
- dynamic scheduling, planning and timetabling
- distributed scheduling, planning and timetabling
- sequencing problems
- scheduling and planning in industrial environments including production
  planning, transportation and distribution
- educational course and exam timetabling
- employee and workforce scheduling
- organisation and resource scheduling
- generation of plans and construction of planners
- plan merging and decomposition of planning problems
- handling multiple goals in scheduling and planning
- planning under resource constraints

Submission deadline:        22 November 2010
Notification of acceptance:        early January 2011
Camera-ready paper        mid January 2011

<... edited for length ...>

Sender: Penousal Machado <[log in to unmask]>
Subject: evostar 2011: Call For Papers

evostar - the main european events on evolutionary computation
eurogp, evocop, evobio and evoapplications
27-29 april 2011 ? torino, italy
http://www.evostar. org

The evo* event comprises the premier co-located conferences in the field of
Evolutionary Computing: eurogp, evocop, evobio and evoapplications. In 2011,
the evo* will take place at the Molecular Biotechnology Center, that hosts
the School for the Biotechnologies of the University of Torino, Italy.

Featuring the latest in theoretical and applied research, evo* topics
include recent genetic programming challenges, evolutionary and other
meta-heuristic approaches for combinatorial optimization, evolutionary
algorithms, machine learning and data mining techniques in the biosciences,
in numerical optimization, in music and art domains, in image analysis and
signal processing, in hardware optimization and in a wide range of
applications to scientific, industrial, financial and other real-world

The proceedings will be published by Springer Verlag in the Lecture Notes in
Computer Science series.

14th European Conference on Genetic Programming
Papers are sought on topics strongly related to the evolution of computer
programs, ranging from theoretical work to innovative applications.

11th European Conference on Evolutionary Computation in Combinatorial
Practical and theoretical contributions are invited, related to evolutionary
computation techniques and other meta-heuristics for solving combinatorial
optimization problems.

9th European Conference on Evolutionary Computation, Machine Learning and
Data Mining in Bioinformatics
Emphasis is on evolutionary computation and other advanced techniques
addressing important problems in molecular biology, proteomics, genomics and
genetics, that have been implemented and tested in simulations and on
real-life datasets.

evoapplications - European Conference on the Applications of Evolutionary
evocomnet - 8th European event on nature-inspired techniques for
            telecommunication networks and other parallel and distributed
evocomplex - 2nd European event on algorithms and complex systems
evofin - 5th European event on evolutionary and natural computation in finance
         and economics
evogames - 3rd European event on bio-inspired algorithms in games
evohot - 6th European event on Bio-Inspired Heuristics for Design Automation
evoiasp - 13th European event on evolutionary computation in image analysis and
          signal processing
evointelligence - 2nd European event on interactive evolution and humanized
                  computational intelligence
evomusart - 9th European event on evolutionary and biologically inspired music,
            sound, art and design
evonum - 4th European event on bio-inspired algorithms for continuous parameter
evostim - 6th European event on Scheduling and Timetabling
evostoc - 8th European event on evolutionary algorithms in stochastic and
          dynamic environments
evotranslog - 5th European event on evolutionary computation in transportation
              and logistics
evophd - 6th Graduate Student Workshop on evolutionary computation

Submissions must be original and not published elsewhere. The submissions will
be peer reviewed by at least three members of the program committee. The authors
of accepted papers will have to improve their paper on the basis of the
reviewers? comments and will be asked to send a camera ready version of their
manuscripts. At least one author of each accepted work has to register for the
conference and attend the conference and present the work.

The reviewing process will be double-blind, please omit information about the
authors in the submitted paper. Submit your manuscript in Springer LNCS format.
The submission deadline is 22 november 2010. The other submission details are
conference specific. Please follow the instructions and links below.

       submission link:
       page limit: 12 pages
       submission link:
       page limit: 12 pages
       submission link:
       evobio is interested in papers in three major areas:
               1. Full research articles (maximum 12 pages)
               2. System Demonstrations (maximum 6 pages)
               3. Short reports (maximum 6 pages)

Submitting to evocomnet, evocomplex, evofin, evogames, evohot, evoiasp,
evointelligence, evomusart, evonum, evostim, evostoc and evotranslog:
       submission link:
       page limit: 10 pages

Submitting to evophd:
       Submissions should be e-mailed in PDF or gzipped postscript to
       The page limit is 14 A4 pages for students? submissions and 20 A4 pages
for PhD-summary submissions, both in Springer LCNS format.

eurogp, evocop, evobio and evoapplications:
       submission deadline: 22 november 2010
       notification to authors: 7 january 2011
       camera-ready deadline: 1 february 2011
       submission deadline: 21 january 2011
       notification to authors: 23 february 2011
       camera-ready deadline: 15 march 2011
evo* event:
       27-29 april 2011

evostar website: http://www.evostar. org
evostar poster:

<... edited for length ...>

Sender: Giovanni Squillero <[log in to unmask]>
Subject: CfP: EvoHOT 2011

We would like to invite you to submit a paper to EvoHOT 2011, the 6th European
Workshop on Hardware Optimization Techniques.

EvoHOT focuses on innovative heuristics, game theory and bio-inspired techniques
(eg. EA, SA, AIS, NN, ants) applied to the Electronic Design Automation.

The workshop goal is to show the latest developments; industrial experiences;
successful attempts to /evolve/ rather than /design/ new solutions;
hybridizations of traditional methodologies.

EvoHOT topics include, but are not limited to:
 * Analog circuit design
 * Automatic test pattern generation
 * Built-in self test
 * Evolutionary design of electronic circuits
 * Evolutionary hardware design methodologies
 * Evolutionary robotics
 * Evolvable hardware
 * Floorplanning
 * Hardware/Software co-design
 * Hybrid evolutionary/exact approach
 * Hardware accelerated methodologies
 * Logic synthesis
 * Routing
 * Test program generation

Submissions should be formatted according to the LNCS guidelines and must not be
longer than 10 pages.

EvoHOT is part of EvoStar (Evo*), the premier co-located conferences in the
field of Evolutionary Computing. The website offers
updated information about EvoHOT and all other Evo* events, including call for
papers, organising committees and detailed submission requirements.

Evo* 2011 will be held in Torino, Italy. In 2011, Italy will celebrate the 150th
anniversary of its unification. Torino, as the first Italian capital, will be
the center of all the celebrations. The investments made to host the 2006 Winter
Olympics made the city of Torino and the region Piemonte very attractive and an
ideal location to host international events.

Important dates common to all Evo* events:
* Submission deadline: 22 november 2010
* Notification to authors: 7 january 2011
* Camera-ready deadline: 1 february 2011
* Conference: 27-29 April 2011

Thanks for your patience and interest
Rolf Drechsler & Giovanni Squillero (EvoHOT chairs)


 - 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


November 2022
February 2022
November 2021
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