Parallel Problem Solving from Nature: 1st Workshop, PPSN I Dortmund, FRG, October 1-3, 1990. Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $4.44
Usually ships in 1-2 business days
(Save 94%)
Other sellers (Paperback)
  • All (10) from $4.44   
  • New (7) from $58.07   
  • Used (3) from $4.44   


With the appearance of massively parallel computers, increased attention has been paid to algorithms which rely upon analogies to natural processes. This development defines the scope of the PPSN conference at Dortmund in 1990 whose proceedings are presented in this volume. The subjects treated include: - Darwinian methods such as evolution strategies and genetic algorithms; - Boltzmann methods such as simulated annealing; - Classifier systems and neural networks; - Transfer of natural metaphors to artificial problem solving. The main objectives of the conference were: - To gather theoretical results about and experimental comparisons between these algorithms, - To discuss various implementations on different parallel computer architectures, - To summarize the state of the art in the field, which was previously scattered widely both among disciplines and geographically.

Read More Show Less

Product Details

  • ISBN-13: 9783540541486
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 7/17/1991
  • Series: Lecture Notes in Computer Science Series, #496
  • Edition description: 1991
  • Edition number: 1
  • Pages: 489
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.01 (d)

Table of Contents

Global convergence of genetic algorithms: A markov chain analysis.- The theory of virtual alphabets.- Towards an optimal mutation probability for genetic algorithms.- An alternative Genetic Algorithm.- An analysis of the interacting roles of population size and crossover in genetic algorithms.- Gleam a system for simulated "intuitive learning".- Genetic algorithms and highly constrained problems: The time-table case.- An evolution standing on the design of redundant manipulators.- Redundant coding of an NP-complete problem allows effective Genetic Algorithm search.- Circuit partitioning with genetic algorithms using a coding scheme to preserve the structure of a circuit.- Genetic algorithms, production plan optimisation and scheduling.- System identification using genetic algorithms.- Conformational analysis of DNA using genetic algorithms.- Operator-oriented genetic algorithm and its application to sliding block puzzle problem.- A topology exploiting genetic algorithm to control dynamic systems.- Genetic local search algorithms for the traveling salesman problem.- Genetic programming artificial nervous systems artificial embryos and embryological electronics.- Concept formation and decision tree induction using the genetic programming paradigm.- On solving travelling salesman problems by genetic algorithms.- Genetic algorithms and punctuated equilibria in VLSI.- Implementing the genetic algorithm on transputer based parallel processing systems.- Explicit parallelism of genetic algorithms through population structures.- Parallel genetic packing of rectangles.- Partitioning a graph with a parallel genetic algorithm.- Solving the mapping-problem — Experiences with a genetic algorithm.- Optimization using distributed genetic algorithms.- Application of the Evolutionsstrategie to discrete optimization problems.- A variant of evolution strategies for vector optimization.- Application of evolution strategy in parallel populations.- Global optimization by means of distributed evolution strategies.- Solving sequential games with Boltzmann-learned tactics.- Optimizing simulated annealing.- Parallel Implementations Of Simulated Annealing / A local timing model for parallel optimization with Boltzmann Machines.- Error-free parallel implementation of simulated annealing.- Trimm: A parallel processor for image reconstruction by simulated annealing.- The response-time constraint in neural evolution.- An artificial neural network representation for artificial organisms.- Feature construction for back-propagation.- Improved convergence rate of back-propagation with dynamic adaption of the learning rate.- Performance evaluation of evolutionarily created neural network topologies.- Optical image preprocessing for neural network classifier system.- Gannet: Genetic design of a neural net for face recognition.- The application of a genetic approach as an algorithm for neural networks.- Genetic improvements of feedforward nets for approximating functions.- Exploring adaptive agency III: Simulating the evolution of habituation and sensitization.- A learning strategy for neural networks based on a modified evolutionary strategy.- Genetic algorithms and the immune system.- Selectionist categorization.- A classifier system with integrated genetic operators.- The fuzzy classifier system: Motivations and first results.- Hints for adaptive problem solving gleaned from immune networks.- A reactive robot navigation system based on a fluid dynamics metaphor.- Transfer of natural metaphors to parallel problem solving applications.- Modelling and simulation of distributed evolutionary search processes for function optimization.- Parallel, decentralized spatial mapping for robot navigation and path planning.- Ecological dynamics under different selection rules in distributed and iterated prisoner's dilemma game.- Adaptation in signal spaces.- A principle of minimum complexity in evolution.- The emergence of data structures from local interactions.- The view from the adaptive landscape.- Boltzmann-, Darwin- and Haeckel-strategies in optimization problems.- Optimizing complex problems by nature's algorithms: Simulated annealing and evolution strategy—a comparative study.- Genetic Algorithms and evolution strategies: Similarities and differences.- Building the ultimate machine: The emergence of artificial cognition.

Read More Show Less

Customer Reviews

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

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & 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 & 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 & 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 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


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & 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 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)