Applications of Evolutionary Computation: EvoApplications 2011: EvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC, Torino, Italy, April 27-29, 2011, Proceedings, Part I

Overview

This book constitutes the refereed proceedings of the International Conference on the Applications of Evolutionary Computation, EvoApplications 2011, held in Torino, Italy, in April 2011 colocated with the Evo* 2011 events. Thanks to the large number of submissions received, the proceedings for EvoApplications 2011 are divided across two volumes (LNCS 6624 and 6625). The present volume contains contributions for EvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC. The 36 revised full papers ...

See more details below
Paperback (2011)
$76.70
BN.com price
(Save 22%)$99.00 List Price
Other sellers (Paperback)
  • All (4) from $52.82   
  • New (2) from $67.07   
  • Used (2) from $52.82   
Sending request ...

Overview

This book constitutes the refereed proceedings of the International Conference on the Applications of Evolutionary Computation, EvoApplications 2011, held in Torino, Italy, in April 2011 colocated with the Evo* 2011 events. Thanks to the large number of submissions received, the proceedings for EvoApplications 2011 are divided across two volumes (LNCS 6624 and 6625). The present volume contains contributions for EvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC. The 36 revised full papers presented were carefully reviewed and selected from numerous submissions. This volume presents an overview about the latest research in EC. Areas where evolutionary computation techniques have been applied range from telecommunication networks to complex systems, finance and economics, games, image analysis, evolutionary music and art, parameter optimization, scheduling, and logistics. These papers may provide guidelines to help new researchers tackling their own problem using EC.

Read More Show Less

Product Details

Table of Contents

EvoComplex Contributions

Evolving L-Systems as an Intelligent Design Approach to Find Classes of Difficult-to-Solve Traveling Salesman Problem Instances Farhan Ahammed Pablo Moscato 1

A Design Framework for Ultra-Large-Scale Autonomic Systems Michele Amoretti 12

Stochastic Local Search to Automatically Design Boolean Networks with Maximally Distant Attractors Stefano Benedettini Andrea Roll Roberto Serra Marco Villani 22

A Study on the Mutation Rates of a Genetic Algorithm Interacting with a Sandpile Carlos M. Fernandes Juan L.J. Laredo Antonio M. Mora Agostinho C. Rosa Juan J. Merelo 32

On the Design of Boolean Network Robots Andrea Roli Mattia Manfroni Carlo Pinciroli Mauro Birattari 43

EvoGames Contributions

Multiple Tree for Partially Observable Monte-Carlo Tree Search David Auger 53

Evolving Interesting Maps for a First Person Shooter Luigi Cardamone Georgios N. Yannakakis Julian Togelius Pier Luca Lanzi 63

Revisiting Monte-Carlo Tree Search on a Normal Form Game: NoGo C.-W. Chou O. Teytaud S.-J. Yen 73

Nested Look-Ahead Evolutionary Algorithm Based Planning for a Believable Diplomacy Bot Markus Kemmerling Niels Ackermann Mike Preuss 83

Towards Procedural Strategy Game Generation: Evolving Complementary Unit Types Tobias Mahlmann Julian Togelius Georgios N. Yannakakis 93

Improving and Scaling Evolutionary Approaches to the MasterMind Problem Juan J. Merelo Carlos Cotta Antonio Mora 103

Training Neural Networks to Play Backgammon Variants Using Reinforcement Learning Nikolaos Papahristou Ioannis Refanidis 113

Evolving Behaviour Trees for the Mario AI Competition Using Grammatical Evolution iego Perez Miguel Nicolau Michael O'Neill Anthony Brabazon 123

Learning Chasing Behaviours of Non-Player Characters in Games Using Sarsa Somnuk Phon-Amnuaisuk 133

Driving Faster Than a Human Player Jan Quadflieg Mike Preuss Günter Rudolph 143

Upper Confidence Trees with Short Term Partial Information Olivier Teytaud Sébastien Flory 153

EvoIasp Contributions

Segmentation of Ultrasound Breast Images: Optimization of Algorithm Parameters Donardo Bocchi Francesco Rogai 163

A Hibrid Particle Swarm Optimisation with Differential Evolution Approach to Image Segmentation nlong Fu Mark Johnston Mengjie Zhang 173

Transparent, Online Image Pattern Classification Using a Learning Classifier System Ignas Kukenys Will N. Browne Mengjie Zhang 183

Tracking Multiple Targets with Adaptive Swarm Optimization Jun Liu Hongbin Ma Xuemei Ren 194

Advanced Metaheuristic Approaches and Population Doping for a Novel: Modeling-Based Method of Positron Emission Tomography Data Analysis J kko Pekkarinen Harri Pölönen Ferrante Neri 204

Evolutionary Synthesis of a Trajectory Integrator for an Analogue Brain-Computer Interface Mouse Riccardo Poli Mathew Salvaris Caterina Cinel 214

Automatic Selection of Pareto-Optimal Topologies of Hidden Markov Models Using Multicriteria Evolutionary Algorithms Pawel Swietojanski Robert Wielgat Tomasz Zielinski 224

EvoIntelligence Contributions

When Novelty Is Not Enough Giuseppe Cuccu Faustino Gomez 234

A Part-Of-Speech Lexicographic Encoding for an Evolutionary Word Sense Disambiguation Approach Antonia Azzini Mauro Dragoni Andrea G.B. Tettamanzi 244

Migrating Birds Optimization: A New Meta-heuristic Approach and Its Application to the Quadratic Assignment Problem Ekrern Duman Mitat Uysal Ali Fuat Alkaya 254

EvoNum Contributions

Opposition-Based Learning in Compact Differential Evolution Giovanni Iacca Ferrante Neri Ernesto Mininno 264

Data Mining Using Unguided Symbolic Regression on a Blast Furnace Dataset Michael Kommenda Gabriel Kronberger Christoph Feilmayr Michael Affenzeller 274

Dispar-Tournament: A Parallel Population Reduction Operator That Behaves Like a Tournament Ogier Maitre Deepak Sharma Nicolas Lachiche Pierre Collet 284

Global Characterization of the Cec 2005 Fitness Landscapes Using Fitness-Distance Analysis Christian L. Müller lvo F. Sbalzarini 294

A Framework for Multi-model EDAs with Model Recombination Thomas Weise Stefan Niemczyk Raymond Chiong Mingxu Wan 304

EvoStoc Contributions

An Investigation of Selection Hyper-heuristics in Dynamic Environments Berna Kiraz A. Sima Uyar Ender Özcan 314

Memory-Based Immigrants for Ant Colony Optimization in Changing Environments Michalis Mavrovouniotis Shengxiang Yang 324

Solving Dynamic Constrained Optimization Problems with Asynchronous Change Pattern Hendrik Richter Franz Dietel 334

Flexible Variable Neighborhood Search in Dynamic Vehicle Routing Briseida Sarasola Mostepha R. Khouadjia Enrique Alba Laetitia Jourdan El-Ghazali Talbi 344

CHC-Based Algorithms for the Dynamic Traveling Salesman problem Anabela Simões Ernesto Costa 354

Author Index 365

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)