FEEDBACK Smiley face
Applications of Evolutionary Computing EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN Kinsale, Ireland, April 3–4, 2002 Proceedings / [electronic resource] : edited by Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl. - XIV, 346 p. online resource. - Lecture Notes in Computer Science, 2279 0302-9743 ; . - Lecture Notes in Computer Science, 2279 .

EvoCOP Talks -- Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation -- SavingsAnts for the Vehicle Routing Problem -- Updating ACO Pheromones Using Stochastic 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 Autocalibration 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.

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.


10.1007/3-540-46004-7 doi

Computer science.
Computer programming.
Computer science--Mathematics.
Artificial intelligence.
Image processing.
Pattern recognition.
Computer Science.
Programming Techniques.
Artificial Intelligence (incl. Robotics).
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Image Processing and Computer Vision.
Pattern Recognition.



© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: