Gift Guide

Genetic Algorithms and Their Applications: Proceedings of the 2nd International Conference on Genetic Algorithms / Edition 1

Paperback (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $20.00
Usually ships in 1-2 business days
(Save 77%)
Other sellers (Paperback)
  • All (6) from $20.00   
  • New (2) from $97.29   
  • Used (4) from $20.00   
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any coupons and promotions
Seller since 2011

Feedback rating:



New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

Brand new and unread! Join our growing list of satisfied customers!

Ships from: Phoenix, MD

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Seller since 2008

Feedback rating:


Condition: New

Ships from: Naperville, IL

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Sort by


First Published in 1987. Routledge is an imprint of Taylor & Francis, an informa company.

Read More Show Less

Product Details

  • ISBN-13: 9780805801590
  • Publisher: Taylor & Francis
  • Publication date: 7/1/1987
  • Edition number: 1
  • Pages: 260
  • Product dimensions: 6.00 (w) x 9.10 (h) x 0.60 (d)

Table of Contents

ContentsGenetic Search Theory. D.E. Goldberg, P. Segrest, Finite Markov Chain Analysis of Genetic Algorithms. C.L. Bridges, D.E. Goldberg, An Analysis of Reproduction and Crossover in a Binary-Coded Genetic Algorithm. J.E. Baker, Reducing Bias and Inefficiency in the Selection Algorithm. T.H. Westerdale, Adaptive Search Operators I.Altruism in the Bucket Brigade. I. StadnykSchema Recombination in Pattern Recognition Problems. J.D. Schaffer, A. Morishima, An Adaptive Crossover Distribution Mechanism for Genetic Algorithms. D.E. Goldberg, J. Richardson, Representation Issues.Genetic Algorithms With Sharing for Multimodal Function Optimization. C.G. Shaefer, The ARGOT Strategy: Adaptive Representation Genetic Optimizer Technique. D.E. Goldberg, R.E. Smith, Nonstationary Function Optimization Using Genetic Algorithms With Dominance and Diploidy. H.J. Antonisse, K.S. Keller, Genetic Operators for High-Level Knowledge Representations. A.S. Bickel, R.W. Bickel, Keynote Address.Tree Structured Rules in Genetic Algorithms. J.H. Holland, Adaptive Search Operators II.Genetic Algorithms and Classifier Systems: Foundations and Future Directions. G.E. Liepins, M.R. Hilliard, M. Palmer, M. Morrow, Greedy Genetics. J.Y. Suh, D. Van Gucht, Incorporating Heuristic Information Into Genetic Search. D. Whitley, Using Reproductive Evaluation to Improve Genetic Search and Heuristic Discovery. D.J. Sirag, P.T. Weisser, Connectionism and Parallelism I.Toward a Unified Thermodynamic Genetic Operator. C.P. Dolan, M.G. Dyer, Toward the Evolution of Symbols. D.G. Oosthuizen, SUPERGRAN: A Connectionist Approach to Learning, Integrating, Genetic Algorithms and Graph Induction. G.G. Robertson, Parallel Implementation of Genetic Algorithms in a Classifier System. J.P. Cohoon, S.U. Hegde, W.N. Martin, D. Richards, Parallelism II.Punctuated Equilibria: A Parallel Genetic Algorithm. C.B. Pettey, M.R. Leuze, J.J. Grefenstette, A Parallel Genetic Algorithm. A.V. Sannier, II, E.D. Goodman, Genetic Learning Procedures in Distributed Environments. P. Jog, D. Van Gucht, Parallelisation of Probablistic Sequential Search Algorithms. R. Tanese, Credit Assignment and Learning.Parallel Genetic Algorithms for a Hypercube. R.L. Riolo, Bucket Brigade Performance: I. Long Sequences of Classifiers. R.L. Riolo, Bucket Brigade Performance: II. Default Hierarchies. J.J. Grefenstette, Multilevel Credit Assignment in a Genetic Learning System. K.A. De Jong, Applications I.On Using Genetic Algorithms to Search Program Spaces. D.P. Greene, S.F. Smith, A Genetic System for Learning Models of Consumer Choice. I.M. Oliver, D.J. Smith, J.R.C. Holland, A Study of Permutation Crossover Operators on the Traveling Salesman Problem. M.R. Hilliard, G.E. Liepins, M. Palmer, M. Morrow, J. Richardson, A Classifier Based System for Discovering Scheduling Heuristics. C. Fujiko, J. Dickinson, Applications II.Using the Genetic Algorithm to Generate LISP Source Code to Solve the Prisoner's Dilemma. V.V. Raghavan, B. Agarwal, Optimal Determination of User- Oriented Clusters: An Application for the Reproductive Plan. S.W. Wilson, The Genetic Algorithm and Biological Development. L. Davis, S. Coombs, Genetic Algorithms and Communication Link Speed Design: Theoretical Considerations. S. Coombs, L. Davis, Genetic Algorithms and Communication Link Speed Design: Constraints and Operators.

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)