Applications of Evolutionary Computing: EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN Kinsale, Ireland, April 3-4, 2002. Proceedings

Overview

This book constitutes the refereed proceedings of three workshops on the application of evolutionary programming and algorithms in various domains; these workshops were held in conjunction with the 5th European Conference on Genetic Programming, EuroGP 2002, in Kinsale, Ireland, in April 2002.
The 33 revised full papers presented were carefully reviewed and selected by the respective program committees. In accordance with the three workshops EvoCOP, EvoIASP, and EvoSTIM/EvoPLAN,...

See more details below
Paperback (2002)
$100.74
BN.com price
(Save 7%)$109.00 List Price
Other sellers (Paperback)
  • All (5) from $1.99   
  • New (3) from $79.70   
  • Used (2) from $1.99   
Sending request ...

Overview

This book constitutes the refereed proceedings of three workshops on the application of evolutionary programming and algorithms in various domains; these workshops were held in conjunction with the 5th European Conference on Genetic Programming, EuroGP 2002, in Kinsale, Ireland, in April 2002.
The 33 revised full papers presented were carefully reviewed and selected by the respective program committees. In accordance with the three workshops EvoCOP, EvoIASP, and EvoSTIM/EvoPLAN, the papers are organized in topical sections on combinatorial optimization problems; image analysis and signal processing; and scheduling, timetabling, and AI planning.

Read More Show Less

Product Details

  • ISBN-13: 9783540434320
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 5/3/2002
  • Series: Lecture Notes in Computer Science Series , #2279
  • Edition description: 2002
  • Edition number: 1
  • Pages: 346
  • Product dimensions: 9.21 (w) x 6.14 (h) x 0.75 (d)

Table of Contents

EvoCOP Talks.- Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation.- SavingsAnts for the Vehicle Routing Problem.- Updating ACO Pheromones Using Shastic Gradient Ascent and Cross-Entropy Methods.- Non-parametric Estimation of Properties of Combinatorial Landscapes.- Performance of Evolutionary Approaches for Parallel Task Scheduling under Different Representations.- A Performance Comparison of Alternative Heuristics for the Flow Shop Scheduling Problem.- Exploiting Fitness Distance Correlation of Set Covering Problems.- A Population Based Approach for ACO.- Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation.- Application of Genetic Algorithms in Nanoscience: Cluster Geometry Optimization.- A Memetic Algorithm for Vertex-Biconnectivity Augmentation.- Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem.- An Experimental Investigation of Iterated Local Search for Coloring Graphs.- Solving Car Sequencing Problems by Local Optimization.- Evolution Strategies, Network Random Keys, and the One-Max Tree Problem.- Evolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema.- Boosting ACO with a Preprocessing Step.- A Memetic Algorithm Guided by Quicksortfor the Error-Correcting Graph Isomorphism Problem.- EvoIASP Talks.- Evolutionary Techniques for Minimizing Test Signals Application Time.- Prediction and Modelling of the Flow of a Typical Urban Basin through Genetic Programming.- Using EAs for Error Prediction in Near Infrared Spectroscopy.- The Prediction of Journey Times on Motorways Using Genetic Programming.- The Boru Data Crawler for Object Detection Tasks in Machine Vision.- Surface Profile Reconstruction from Scattered Intensity Data Using Evolutionary Strategies.- Detection of Incidents on Motorways in Low Flow High Speed Conditions by Genetic Programming.- Image Filter Design with Evolvable Hardware.- A Dynamic Fitness Function Applied to Improve the Generalisation when Evolving a Signal Processing Hardware Architecture.- Efficiently Computable Fitness Functions for Binary Image Evolution.- Evolutionary Based Aualibration from the Fundamental Matrix.- Medical Image Registration Using Parallel Genetic Algorithms.- EvoSTIM/EvoPLAN Talks.- Disruption Management for an Airline — Rescheduling of Aircraft.- Ant Colony Optimization with the Relative Pheromone Evaluation Method.- Improving Street Based Routing Using Building Block Mutations.

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)