Applications of Evolutionary Computing
Editat de Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidlen Limba Engleză Paperback – 20 mar 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.
Preț: 325.25 lei
Preț vechi: 406.56 lei
-20%
Puncte Express: 488
Preț estimativ în valută:
57.51€ • 66.46$ • 49.69£
57.51€ • 66.46$ • 49.69£
Carte tipărită la comandă
Livrare economică 05-19 mai
Specificații
ISBN-13: 9783540434320
ISBN-10: 3540434321
Pagini: 360
Ilustrații: XIV, 346 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540434321
Pagini: 360
Ilustrații: XIV, 346 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.55 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras