[info] EC-Digest v21n11
Eugen Leitl
<eugen at leitl.org> on
Sat Dec 15 08:49:44 UTC 2007
----- Forwarded message from Ozlem Ozmen Garibay <ozlem at CS.UCF.EDU> -----
From: Ozlem Ozmen Garibay <ozlem at CS.UCF.EDU>
Date: Fri, 14 Dec 2007 23:44:25 -0500
To: EC-DIGEST-L at mail04.GMU.EDU
Subject: EC-Digest v21n11
X-Mailer: Microsoft Office Outlook 11
Reply-To: Evolutionary Computation Digest <EC-DIGEST-L at mail04.GMU.EDU>
Evolutionary Computation Digest Friday, December, 14 2007 Volume 21 : Issue 11
SUBMISSION ADDRESS: EC-Digest-L at listserv.gmu.edu
LIST INFORMATION: http://ec-digest.research.ucf.edu/
OLD LIST ARCHIVE: http://www.aic.nrl.navy.mil/galist/
NEW LIST ARCHIVE: http://listserv.gmu.edu/cgi-bin/wa?A0=EC-DIGEST-L
(UN)SUBSCRIPTION INSTRUCTIONS: at the bottom of this email
--------------------------------
Today's Topics:
ANNOUNCEMENTS
-------------
- new book
- IDEAL 2007: Call for Participation
- New Book Announcement
- Invitation to Picbreeder Collaborative,Interactive Evolution Website
- SIGEVOlution Volume 2, Issue 2
CFPs
----
- What is Computational Swarm Intelligence? An AISB 2008 symposium.
- ANTS 2008 - Sixth Intl. Conf. on Ant Colony Opt. and Swarm Intelligence
- CFP Matheuristics 2008
- ISD2008 IIS track
- WEA 2008 Call for papers
- PPSN 2008 Call for workshop proposals
- GECCO Workshop: ECoMASS 2008
--------------------------------
CALENDAR OF GA-RELATED ACTIVITIES: (with EC-Digest issue reference)
IICAI'07, 3rd Indian Intl Conf on Artificial Intell, India, Dec 17-19,07(v21n3)
EVO*'08, European Events on Ev. Computation, Napoli,Italy, Mar 26-28'08 (v21n8)
GECCO'08, Genetic and Evolutionary Conference, Atlanta,GA,July 12-16,08 (v21n7)
PPSN'08,Parallel Prob. Solving From Nature,Dortmund,Germany,Sep13-17,08(v21n11)
Send announcements of other activities to EC-Digest-L at listserv.gmu.edu
--------------------------------
Sender: Zbigniew Michalewicz <zbigniew.michalewicz at adelaide.edu.au>
Subject: new book
Title: Advances in Metaheuristics for Hard Optimization
Patrick Siarry & Zbigniew Michalewicz (Eds)
Springer, Natural Computing Series
ISBN 978-3-540-72959-4. November 2007.
481 p. 167 illus., Hardcover
http://www.springer.com/france/home/generic/search/results?SGWID=
7-40109-22-173745030-0
Many advances have recently been made in metaheuristic methods, from theory to
applications. The editors, both leading experts in this field, have assembled a
team of researchers to contribute 21 chapters organized into parts on simulated
annealing, tabu search, ant colony algorithms, general purpose studies of
evolutionary algorithms, applications of evolutionary algorithms, and
metaheuristics.
The book gathers contributions related to the following topics: theoretical
developments in metaheuristics, adaptation of discrete metaheuristics to
continuous optimization, performance comparisons of metaheuristics, cooperative
methods combining different approaches, parallel and distributed metaheuristics
for multiobjective optimization, software implementations, and real-world
applications.
This book is suitable for practitioners, researchers and graduate students in
disciplines such as optimization, heuristics, operations research, and natural
computing.
Written for:
Researchers and graduate students in computer science and fields related to
optimization (operations research, mathematics).
Keywords:
Ant colony optimization, Ant systems, Evolutionary computing, Hard optimization,
Heuristic methods, Multiobjective optimization, Simulated annealing, Tabu
search.
Zbigniew Michalewicz
www.cs.adelaide.edu.au/~zbyszek
[... edited due to length .... ]
--------------------------------
Sender: IDEAL 07 [ideal07 at cs.bham.ac.uk>
Subject: IDEAL 2007: Call for Participation
Dear Colleagues
IDEAL 2007 will be held at the second largest city of the UK,
Birmingham, during December 16-19 2007. The programme is now available
on the website,
http://events.cs.bham.ac.uk/ideal07/
The IDEAL conference has become a unique multidisciplinary forum for
researchers in both theoretical and practical aspects of learning and
information processing, data mining, retrieval and management,
bioinformatics and bio-inspired models, agents and hybrid systems, and
financial engineering. A special feature of the IDEAL conferences is the
cross-disciplinary exchange of ideas in emerging techniques and
applications in these areas. Data engineering and associated learning
paradigms are playing increasingly important roles in an increasing
number of disciplines and fields. One of the principal aims of the IDEAL
conference is to promote interactions and collaborations across
disciplines.
This 8th IDEAL conference will also enjoy outstanding keynote speeches
by distinguished guest speakers: Piero Bonissone, GE Global Research,
Kevin Kelly, Carnegie Mellon University, Toby Gibson, European Molecular
Biology Laboratory, and Soo-Young Lee of the Korea Advanced Institute of
Science and Technology. They will provide in-depth coverages and updates
on various challenging topics.
On the afternoon of Sunday 16^th December there will be workshops and
tutorials - free for all registered attendees. Details will be available
shortly.
We look forward to meeting you in Birmingham in December.
Sincerely,
IDEAL 2007 Programme and Organising Committees
--------------------------------
Sender: <coello at cs.cinvestav.mx>
Subject: New Book Announcement
Evolutionary Algorithms for Solving Multi-Objective Problems
Second Edition
Carlos A. Coello Coello, Gary B. Lamont and David A. Van Veldhuizen
Springer
Genetic and Evolutionary Computation Series
ISBN: 978-0-387-33254-3. September 2007.
800 pages, 50 illustrations, Hardcover.
Price: $99 US
http://www.springer.com/west/home?SGWID=4-102-22-173660344-0&changeHeader=true
http://www.cs.cinvestav.mx/~emoobook/
This textbook is the second edition of Evolutionary Algorithms
for Solving Multi-Objective Problems, significantly augmented
with contemporary knowledge and adapted for the classroom. All
the various features of multi-objective evolutionary algorithms
(MOEAs) are presented in an innovative and student-friendly
fashion, incorporating state-of-the-art research results. The
diversity of serial and parallel MOEA structures are given,
evaluated and compared. The book provides detailed insight into
the application of MOEA techniques to an array of practical
problems. The assortment of test suites are discussed along with
the variety of appropriate metrics and relevant statistical
performance techniques.
Distinctive features of the new edition include:
* Designed for graduate courses on Evolutionary Multi-Objective
Optimization, with exercises and links to a complete set of teaching
material including tutorials
* Updated and expanded MOEA exercises, discussion questions and
research ideas at the end of each chapter
* New chapter devoted to coevolutionary and memetic MOEAs with
added material on solving constrained multi-objective problems
* Additional material on the most recent MOEA test functions and
performance measures, as well as on the latest developments on the
theoretical foundations of MOEAs
* An exhaustive index and bibliography
Keywords:
Evolutionary Algorithms, Genetic Algorithms, MOEA, Multi-Objection Problems,
global optimization, multi-criteria decision making, multi-objective
optimization multi-objective problems, multiobjection optimization,
parallelization, stochastic algorithms
======
Dr. Carlos A. Coello Coello
[... edited due to length .... ]
--------------------------------
Sender: Jimmy Secretan <jimmy at thepublicgrid.org>
Subject: Invitation to Picbreeder Collaborative,Interactive Evolution Website
Dear Colleagues,
The Evolutionary Complexity Group (E-plex) (http://eplex.cs.ucf.edu) at
the University of Central Florida (http://www.ucf.edu) is pleased to
announce a new interactive website called Picbreeder
(http://www.picbreeder.org), which is a large-scale on-line experiment
in Collaborative Interactive Evolution (CIE) of artwork. We invite the
evolutionary computation community to visit and participate.
Like in other genetic art programs, users evolve images by selecting
ones that appeal to them to produce the next generation. However,
Picbreeder goes beyond previous efforts by offering an online community
in which to share these images, and most importantly, the ability to
continue evolving others' image. As a result, users have been able to
evolve genuinely recognizable objects such as faces, cars, and animals,
all without any a priori knowledge in the system. Please see our recent
short publication on Picbreeder for more information:
http://eplex.cs.ucf.edu/index.php?option=com_content&task=view&id=14&Itemid=
28#secretan.leonardotrans07
Picbreeder: Collaborative Interactive Evolution of Images
Jimmy Secretan, Nicholas Beato, David B. D'Ambrosio, Adelein Rodriguez,
Adam Campbell and Kenneth O. Stanley
In: Leonardo (Transactions Section) Vol. 41, No. 1 (2007)
--------------------------------
Sender: Pier Luca Lanzi [lanzi at elet.polimi.it]>
Subject: SIGEVOlution Volume 2, Issue 2
The new issue of SIGEVOlution is now available for you to download from:
http://www.sigevolution.org
The issue features:
* ACO for Vehicle Routing Problems
by Dario Coltorti & Andrea E. Rizzoli
* XCSF in Java by Martin V. Butz
* Lost Gems of EC
* Announcements
* New Books
* Forthcoming Papers
* Calls and Calendar
The newsletter is intended to be viewed electronically.
Pier Luca Lanzi (EIC)
--------------------------------
Sender: Dan Bratton <dbratton at tortuca.org>
Subject: What is Computational Swarm Intelligence? An AISB 2008 symposium.
***What is Computational Swarm Intelligence?***
A symposium of the AISB 2008 Convention on Communication, Interaction and
Social Intelligence, April 1st - 4th, 2008, Aberdeen, Scotland.
Website: http://igor.gold.ac.uk/~mas01tb/AISB08/index.html
Are there any unifying principles underlying the behaviour of swarm
algorithms and how they can be effectively harnessed to develop new
computational techniques?
This symposium is particularly interested in discussing the conceptual and
theoretical overlaps between common swarm algorithms such as Particle
Swarm Optimisation (PSO), Ant Colony Optimisation (ACO) and Stochastic
Diffusion Search (SDS). Are they compatible? And if they are incompatible,
what are the overlapping problem domains? Previous research directions
have looked towards physics and, in particular, biology for new ideas.
Computational Swarm Intelligence (CSI) can now, however, be regarded as an
autonomous aggregate of techniques and ideas that so far have not been
unified. Is there a mathematical, algorithmic framework which will enable
us to understand and analyse these algorithms? The aim of this symposium
is not to say which algorithm is superior at which problem, but rather to
make comparisons at a conceptual level.
The symposium will run for a single day during the main AISB convention.
At the end of the paper presentations, an informal debate will attempt to
hammer out a CSI metaheuristic.
Topics
Papers are welcomed on any theoretical, conceptual or mathematical issue
that advances and generalises our understanding of any single CSI paradigm
(PSO, ACO, SDS,...). Attempts to formulate a CSI metaheuristic, to make
cross-algorithm comparisons and/or attempt a unification are particularly
welcome. Any work which links CSI to results in the field of Global
Optimisation (GO), and any advances in GO which may reflect back on a CSI
metaheuristic are also invited. Any output which may justifiably move us
closer to an answer to our question will be warmly received.
Please see the symposium website at
http://igor.gold.ac.uk/~mas01tb/AISB08/index.html for more information
and submission details.
--------------------------------
Sender: Thomas Stuetzle <stuetzle at ulb.ac.be>
Subject: ANTS 2008 - Sixth Intl. Conf. on Ant Colony Opt. and Swarm Inteligence
ANTS 2008
Sixth International Conference on
Ant Colony Optimization and Swarm Intelligence
September 22-24, 2008. Brussels, Belgium
More details and up-to-date information at
http://iridia.ulb.ac.be/ants2008
Swarm intelligence is a relatively new discipline that deals with the
study of self-organizing processes both in nature and in artificial
systems. Researchers in ethology and animal behavior have proposed
many models to explain interesting aspects of social insect behavior
such as self-organization and shape-formation. Recently, algorithms
inspired by these models have been proposed to solve difficult
computational problems.
ANTS 2008 will give researchers in swarm intelligence the opportunity
to meet, to present their latest research, and to discuss current
developments and applications.
The three-day conference will be held in Brussels, Belgium, on September
22-24, 2008. Tutorial sessions will be held in the mornings before
the conference program.
Conference proceedings will be published by Springer in the LNCS series.
Submission deadline: March 16, 2008
====================
Conference Chair: Marco Dorigo, IRIDIA, ULB, Brussels, Belgium
[... edited due to length .... ]
--------------------------------
Sender: Vittorio Maniezzo <vittorio.maniezzo at unibo.it>
Subject: CFP Matheuristics 2008
Call For Papers: Matheuristics 2008, June 16-18, 2008, Bertinoro, Italy.
Building on the success of the first Matheuristics meeting (August,
2006), the Matheuristics 2008 workshop is proposed as a primary forum
for researchers working either on exploiting mathematical programming
(MP) techniques in a (meta)heuristic framework or on granting to
mathematical programming approaches the cross-problem robustness and
constrained-CPU-time effectiveness which characterize metaheuristics.
Discriminating landmark is some form of exploitation of the mathematical
formulation of the problems of interest.
Metaheuristic algorithms and frameworks, such as tabu search, genetic
algorithms, VNS, etc., were in fact usually proposed in years when Mixed
Integer Programming (MIP) was seldom a viable option for solving
real-world problem instances, or significant subproblems thereof.
However, research on mathematical programming, and in particular on
discrete optimization, has led to a state of the art where MIP solvers
or customized MP codes can be effective even in a heuristic context,
both as primary solvers or as subprocedures. Matheuristics 2008 will
help defining the state of the art for the computational effectiveness
and efficiency or theoretical properties of integrated
metaheuristics/MIP codes (MH codes).
Topics of interest include:
- Dual information and metaheuristics;
- Decompositions and lower/upper bounds in MH codes;
- Upper and lower bounds interacting evolutions;
- Stochastic programming and heuristic search;
- Metaheuristics for stochastic problems;
- Model-based metaheuristics;
- MIP solvers as search components (local branching, RINS, .);
- Hybridizing (meta)heuristics and exact methods;
- Experimental analysis and modeling of algorithms;
- Real world case histories of successful MH applications.
Matheuristics 2008 is not interested in heuristics tailored to a
specific problem that have no element which can be generalized to other
problems - no matter how mathematically sophisticated they are - nor in
metaheuristics variants which are not justified by a mathematical model.
High-quality scientific contributions to the listed topics are
solicited, max 12 pages.
April 15, 2008: Deadline for submissions.
Please see the conference web site for full and up-to-date information:
http://astarte.csr.unibo.it/matheuristics2008
If you have any questions, please contact Vittorio Maniezzo at
vittorio.maniezzo at unibo.it.
[... edited due to length .... ]
--------------------------------
Sender: Stratos F Georgopoulos <efgeo at kal.forthnet.gr>
Subject: ISD2008 IIS track
CALL FOR PAPERS
17th International Conference on Information Systems Development (ISD2008)
INTELLIGENT INFORMATION SYSTEMS TRACK
Paphos, Cyprus August 25-27, 2008
http://isd2008.cs.ucy.ac.cy
IMPORTANT DATES
Papers submission: April 15, 2008
Notification of acceptance: June 15, 2008
Camera-ready papers: July 15, 2008
Conference: August 25-27, 2008
INTELLIGENT INFORMATION SYSTEMS TRACK
The track on Intelligent Information Systems is organised within the 17th
International Conference on Information Systems Development (ISD 2008) and
aims to present current research and development results focused on the
application of Computational Intelligence and Artificial Intelligence techniques
to the creation of next generation Information Systems for many application areas.
It comprises the following (non exclusive) list of topics:
* Intelligent Systems in Biology and Medicine
* Intelligent Signal Processing
* Intelligent Decision Support Systems
* Neural Intelligent Systems
* Intelligent Systems in Software Engineering
* Intelligent Systems in Agriculture
* Intelligent Systems in Finance
* Biological Inspired Computing
* Intelligent Data Mining
* Neurocomputing
* Brain Modeling
The language of the conference will be English and we invite full research
papers (4000-7000 words) as well as industry project reports (2500-4000 words),
work-in-progress papers, and position papers. All submissions will be
blind-reviewed by an international programme committee. Springer Science and
Business Media are contracted to publish the proceedings as a hard cover book
after the conference.
For more information about the track on Intelligent Information Systems,
please contact:
Spiros Likothanassis, Professor
E-mail: likothan at cti.gr
Adam Adamopoulos, Assistant Professor
E-mail: adam at med.duth.gr
Efstratios F. Georgopoulos, Assistant Professor,
E-mail: sfg at teikal.gr
[... edited due to length .... ]
--------------------------------
Sender: Mike Preuss <mike.preuss at UNI-DORTMUND.DE>
Subject: WEA 2008 Call for papers
WEA 2008: 7th International Workshop on Experimental Algorithms
May 30 - June 2, 2008
Provincetown, Cape Cod, Massachusetts, USA
http://www.cs.amherst.edu/ccm/wea08/
CALL FOR PAPERS:
The WEA Workshops are intended to be an international forum for researchers
in the area of experimental evaluation and engineering of algorithms, as
well as in aspects of computational optimization and its applications. The
focus of the workshop is on using experimental methods to support algorithm
design and analysis.
All submissions will be refereed. The proceedings of WEA 2008 will be
published by Springer Verlag in a volume of Lecture Notes in Computer
Science. A subset of papers will be invited to be expanded and published in
a Special Section of the ACM Journal of Experimental Algorithms
Visit www.cs.amherst.edu/ccm/wea08/ for information and workshop deadlines.
General and Program Chair: Catherine C. McGeoch, Amherst College, USA, (ccm
at cs dot amherst dot edu)
TOPICS including but not limited to:
* Algorithm Engineering
* Algorithmic Mechanism Design
* Analysis of Algorithms
* Approximation Techniques
* Branch and Bound Algorithms
* Combinatorial Structures and Graphs
* Combinatorial and Irregular Problems
* Communication Networks
* Computational Learning Theory
* Computational Optimization
* Computer Systems
* Cryptography and Security
* Data Structures
* Distributed Algorithms
* Evaluation of Algorithms for Realistic Environments
* Graph Drawing
* Heuristics for Combinatorial Optimization
* Implementation, Testing, Evaluation and Fine-tuning of Algorithms
* Information Retrieval
* Integer Programming
* Logistics and Operations Management
* Machine Learning and Data Mining
* Mathematical Programming
* Metaheuristic Methodologies
* Network Analysis
* Novel Applications of Algorithms in Other Disciplines
* On-line Problems
* Parallel Algorithms and Computing
* Railway Optimization using Algorithmic Methods
* Randomized Techniques
* Robotics
* Semidefinite Programming
* Simulation
* Software Repositories and Platforms for using Algorithms
* Telecommunications and Networking
* World Wide Web Algorithms
[... edited due to length .... ]
--------------------------------
Sender: Mike Preuss <mike.preuss at UNI-DORTMUND.DE>
Subject: PPSN 2008 Call for workshop proposals
Website: www.ppsn2008.de
CALL FOR WORKSHOP PROPOSALS
SCOPE
We cordially invite proposals for workshops to be affiliated with the PPSN
2008. In contrast to the conference itself, which is focused on completed
works, the workshops shall rather be a forum for new approaches, visions, or
critical reflections within a subfield. Particularly, every form of
interaction (e.g. discussion) between the participants would be warmly
welcomed. It is of course in the responsibility of the workshop organizers
to fix details for possible paper submission or acceptance. However, we
suggest not to ask for full papers, but rather for concept papers or
abstracts of not more than a few pages length. As only one day is available
for workshops, we encourage to plan for half a day to enable some movement
between several focused groups (at lunchtime).
Submission details
Prospective workshop organisers are invited to submit a free-form plain text
workshop proposal form to the PPSN 2008 workshop chair, preferrably by
e-mail to:
mike.preuss at uni-dortmund.de
IMPORTANT DATES
Submission due: January 31, 2008
Notification of acceptance: shortly after submission deadline
Conference: September 13-17, 2008
--------------------------------
Sender: Sevan G. Ficici <sevan at eecs.harvard.edu>
Subject: GECCO Workshop: ECoMASS 2008
WORKSHOP ON
Evolutionary Computation and Multi-Agent Systems
and Simulation Workshop (ECoMASS-2008)
to be held as part of the
2008 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO-2008)
July 12-16, 2008 (Saturday-Wednesday), Atlanta, Georgia, USA
www.sigevo.org/gecco-2008/
PAPER SUBMISSION DEADLINE FOR WORKSHOP: MARCH 21, 2008
Workshop URL: http://www.eecs.harvard.edu/~sevan/ecomass08/
---------------------------------------------------------------
Evolutionary computation (EC) and multi-agent systems and simulation
(MASS) both involve populations of agents. EC is a learning technique
by which a population of individual agents adapt according to the
selection pressures exerted by an environment; MASS seeks to
understand how to coordinate the actions of a population of (possibly
selfish) autonomous agents that share an environment so that some
outcome is achieved. Both EC and MASS have top-down and bottom-up
features. For example, some aspects of multi-agent system engineering
(e.g., mechanism design) are concerned with how top-down structure can
constrain or influence individual decisions. Similarly, most work in
EC is concerned with how to engineer selective pressures to drive the
evolution of individual behavior towards some desired goal. Multi-agent
simulation (also called agent-based modeling) addresses the bottom-up
issue of how collective behavior emerges from individual action.
Likewise, the study of evolutionary dynamics within EC (for example in
coevolution) often considers how population-level phenomena emerge from
individual-level interactions. Thus, at a high level, we may view EC and
MASS as examining and utilizing analogous processes. It is therefore
natural to consider how knowledge gained within EC may be relevant to
MASS, and vice versa; indeed, applications and techniques from one field
have often made use of technologies and algorithms from the other field.
Studying EC and MASS in combination is warranted and has the potential
to contribute to both fields.
The goal of this workshop is to facilitate the examination and
development of techniques at the intersection of evolutionary
computation and multi-agent systems and simulation.
Topics and themes include (but are not limited to):
-Multi-agent systems and agent-based models utilizing evolutionary
computation
-Optimization of multi-agent systems and agent-based models using
evolutionary computation
-Evolutionary computation models which rely not on explicit fitness
functions but rather implicit fitness functions defined by the
relationship to other individuals / agents
-Applications utilizing MASS and EC in combination
-Biological agent-based models (usually called individual-based
models) involving evolution
-Evolution of cooperation and altruism
-Genotypic representation of the complex phenotypic strategies of MASS
-Evolutionary learning within MASS (including Baldwinian learning and
phenotypic plasticity)
-Emergence and feedbacks
-Open-ended strategy spaces and evolution
-Adaptive individuals within evolving populations
*Paper Submission
See http://www.eecs.harvard.edu/~sevan/ecomass08/ for details.
*Important Dates
Paper submission deadline: 21 March, 2008
Notification of acceptance: 2 April, 2008
[... edited due to length .... ]
--------------------------------
(UN)SUBSCRIPTION INSTRUCTIONS:
- Send submissions (articles) to EC-Digest-L at listserv.gmu.edu.
DO NOT send submissions to the listserv at listserv.gmu.edu address.
- To subscribe send email to listserv at listserv.gmu.edu 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 listserv at listserv.gmu.edu 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 ec-digest-l-request at listserv.gmu.edu.
- For further information about the digest, see
http://ec-digest.research.ucf.edu
--------------------------------
End of Evolutionary Computation Digest
********************************
----- End forwarded message -----
--
Eugen* Leitl <a href="http://leitl.org">leitl</a> http://leitl.org
______________________________________________________________
ICBM: 48.07100, 11.36820 http://www.ativel.com http://postbiota.org
8B29F6BE: 099D 78BA 2FD3 B014 B08A 7779 75B0 2443 8B29 F6BE
More information about the info
mailing list