• Contact

  • Newsletter

  • About us

  • Delivery options

  • Prospero Book Market Podcast

  • The Practical Handbook of Genetic Algorithms: New Frontiers, Volume II

    The Practical Handbook of Genetic Algorithms by Chambers, Lance D.;

    New Frontiers, Volume II

    Series: Practical Handbook of Genetic Algorithms Vol. 2; II;

      • GET 20% OFF

      • The discount is only available for 'Alert of Favourite Topics' newsletter recipients.
      • Publisher's listprice GBP 160.00
      • The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.

        76 440 Ft (72 800 Ft + 5% VAT)
      • Discount 20% (cc. 15 288 Ft off)
      • Discounted price 61 152 Ft (58 240 Ft + 5% VAT)

    76 440 Ft

    db

    Availability

    Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
    Not in stock at Prospero.

    Why don't you give exact delivery time?

    Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.

    Product details:

    • Edition number and title New Frontiers Vol 2
    • Edition number 1
    • Publisher CRC Press
    • Date of Publication 15 August 1995

    • ISBN 9780849325298
    • Binding Hardback
    • No. of pages448 pages
    • Size 234x156 mm
    • Weight 826 g
    • Language English
    • Illustrations 4 Halftones, black & white; 40 Tables, black & white
    • 0

    Categories

    Short description:

    Presenting the topic from a an applications point of view, this text takes readers from the construction of a simple GA to advanced implementations. As readers come to understand GAs and their processes, they will begin to understand the power of the genetic-based problem-solving paradigms that lie behind them. Problems that for many have been cons

    More

    Long description:

    The mathematics employed by genetic algorithms (GAs)are among the most exciting discoveries of the last few decades. But what exactly is a genetic algorithm? A genetic algorithm is a problem-solving method that uses genetics as its model of problem solving. It applies the rules of reproduction, gene crossover, and mutation to pseudo-organisms so those "organisms" can pass beneficial and survival-enhancing traits to new generations. GAs are useful in the selection of parameters to optimize a system's performance. A second potential use lies in testing and fitting quantitative models. Unlike any other book available, this interesting new text/reference takes you from the construction of a simple GA to advanced implementations. As you come to understand GAs and their processes, you will begin to understand the power of the genetic-based problem-solving paradigms that lie behind them.

    More

    Table of Contents:

    Contents
    Introduction
    Multi-Niche Crowding for Multi-modal Search
    Introduction
    Genetic Algorithms for Multi-modal Search
    Application of MNC to Multi-modal Test Functions
    Application to DNA Restriction Fragment Map Assembly
    Results and Discussion
    Conclusions
    Previous Related Work and Scope of Present Work
    Appendix
    Artificial Neural Network Evolution: Learning to Steer a Land Vehicle
    Overview
    Introduction to Artificial Neural Networks
    Introduction to ALVINN
    The Evolutionary Approach
    Task Specifics
    Implementation and Results
    Conclusions
    Future Directions
    Locating Putative Protein Signal Sequences
    Introduction
    Implementation
    Results of Sample Applications
    Parametrization Study
    Future Directions
    Selection Methods for Evolutionary Algorithms
    Fitness Proportionate Selection (FPS)
    Windowing
    Sigma Scaling
    Linear Scaling
    Sampling Algorithms
    Ranking
    Linear Ranking
    Exponential Ranking
    Tournament Selection
    Genitor or Steady State Models
    Evolution Strategy and Evolutionary Programming Methods
    Evolution Strategy Approaches
    Top-n Selection
    Evolutionary Programming Methods
    The Effects of Noise
    Conclusions
    References
    Parallel Cooperating Genetic Algorithms: An Application to Robot Motion Planning
    Introduction
    Principles of Genetic Algorithms
    The Search Algorithm
    The Explore Algorithm
    The Ariadne’s CLEW Algorithm
    Parallel Implementation
    Conclusion, Results, and Perspective
    The Boltzmann Selection Procedure
    Introduction
    Empirical Analysis
    Introduction to Boltzmann Selection
    Theoretical Analysis
    Discussion and Related Work
    Conclusion
    Structure and Performance of Fine-Grain Parallelism in Genetic Search
    Introduction
    Three Fine

    More