Parallel Problem Solving from Nature - PPSN III: International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature, Jerusalem, Israel, October 9 - 14, 1994. Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$160.55
Used and New from Other Sellers
Used and New from Other Sellers
from $17.98
Usually ships in 1-2 business days
(Save 89%)
Other sellers (Paperback)
  • All (6) from $17.98   
  • New (3) from $119.33   
  • Used (3) from $17.98   

Overview

This volume comprises the 61 revised refereed papers accepted for presentation at the ICEC/PPSN III conferences held jointly in Jerusalem, Israel in October 1994.
With the appearance of more and more powerful computers, there is increased interest in algorithms relying upon analogies to natural processes. This book presents a wealth of new theoretical and experimental results on artificial problem solving by applying evolutionary computation metaphors, including evolution strategies, evolutionary programming, genetic algorithms, genetic programming, and classifier systems. Topics such as simulated annealing, immune networks, neural networks, fuzzy systems, and complex, real-world optimization problems are also treated.

Read More Show Less

Product Details

  • ISBN-13: 9783540584841
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 10/27/1994
  • Series: Lecture Notes in Computer Science Series , #866
  • Edition description: 1994
  • Edition number: 1
  • Pages: 647
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.41 (d)

Table of Contents

Lamarckian evolution, the Baldwin effect and function optimization.- Control of parallel population dynamics by social-like behavior of GA-individuals.- Studying genotype-phenotype interactions: A model of the evolution of the cell regulation network.- A diploid genetic algorithm for preserving population diversity — Pseudo-Meiosis GA.- Co-evolutionary constraint satisfaction.- Towards a theory of ‘evolution strategies’: Results for (1 , +—)-strategies on (nearly) arbitrary fitness functions.- Advanced correlation analysis of operators for the traveling salesman problem.- Genetic algorithms with multi-parent recombination.- On the mean convergence time of evolutionary algorithms without selection and mutation.- Estimating the heritability by decomposing the genetic variance.- Analyzing hyperplane synthesis in genetic algorithms using clustered schemata.- Convergence models of genetic algorithm selection schemes.- Optimal population size under constant computation cost.- An evolutionary algorithm for integer programming.- Long path problems.- Evolution strategies on noisy functions how to improve convergence properties.- Selection schemes with spatial isolation for genetic optimization.- A modified edge recombination operator for the Travelling Salesman Problem.- Step-size adaptation based on non-local use of selection information.- Strategy adaptation by competing subpopulations.- Controlling crossover through inductive learning.- Derivative operators for preference predicate evolution.- Adaptive crossover using automata.- Controlling dynamics of GA through filtered evaluation function.- A cooperative coevolutionary approach to function optimization.- A fuzzy classifier system using the Pittsburgh approach.- Q-learning in Evolutionary Rule Based Systems.- On the complexity of learning in classifier systems.- A representation scheme to perform program induction in a canonical genetic algorithm.- Genetic Programming with local hill-climbing.- Dynamic training subset selection for supervised learning in Genetic Programming.- Genotype-phenotype-mapping and neutral variation — A case study in Genetic Programming.- Genetic L-System Programming.- A genetic algorithm discovers particle-based computation in cellular automata.- Simulation of exaptive behaviour.- Artificial spacing patterns in a network of interacting celloids.- Diffuse pattern learning with Fuzzy ARTMAP and PASS.- Different learning algorithms for Neural Networks — A comparative study.- Program search with a hierarchical variable length representation: Genetic Programming, simulated annealing and hill climbing.- Problem-independent Parallel Simulated Annealing using selection and migration.- Parallel optimization of evolutionary algorithms.- Parallel simulated annealing and genetic algorithms: A space of hybrid methods.- ENZO-M — A hybrid approach for optimizing neural networks by evolution and learning.- Genetic lander: An experiment in accurate neuro-genetic control.- Effects of Occam's razor in evolving Sigma-Pi neural nets.- Designing neural networks by adaptively building blocks in cascades.- Hybrid adaptive heuristic critic architectures for learning in mazes with continuous search spaces.- Mutation operators for structure evolution of neural networks.- Implementation of standard genetic algorithm on MIMD machines.- Loosely coupled distributed genetic algorithms.- Applying Evolvable Hardware to autonomous agents.- Genetic Algorithms on LAN-message passing architectures using PVM: Application to the Routing problem.- Genetic algorithm based design optimization of CMOS VLSI circuits.- Improving evolutionary timetabling with delta evaluation and directed mutation.- Genetic improvement of railway timetables.- Using a genetic algorithm to search for the representational bias of a collective reinforcement learner.- An evolutionary algorithm for the routing of multi-chip modules.- System design under uncertainty: Evolutionary optimization of the Gravity Probe-B spacecraft.- Soft selection in D-optimal designs.- The weighted graph bi-partitioning problem: A look at GA performance.- RPL2: A language and parallel framework for evolutionary computing.

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)