Evolutionary Computation 1
Home > Computing and Information Technology > Information technology: general topics > Evolutionary Computation 1: Basic Algorithms and Operators
Evolutionary Computation 1: Basic Algorithms and Operators

Evolutionary Computation 1: Basic Algorithms and Operators

|
     0     
5
4
3
2
1




International Edition


About the Book

The field of evolutionary computation is expanding dramatically, fueled by the vast investment that reflects the value of applying its techniques. Culling material from the Handbook of Evolutionary Computation, Evolutionary Computation 1: Basic Algorithms and Operators contains up-to-date information on algorithms and operators used in evolutionary computing. This volume discusses the basic ideas that underlie the main paradigms of evolutionary algorithms, evolution strategies, evolutionary programming, and genetic programming. It is intended to be used by individual researchers, teachers, and students working and studying in this expanding field.

Table of Contents:
PART 1 WHY EVOLUTIONARY COMPUTATION? 1. Introduction to evolutionary computation. 2. Possible applications of evolutationary computation. 3. Advantages (and disadvantages) of evolutionary computation over other approaches. PART 2. EVOLUTIONARY COMPUTATION: THE BACKGROUND. 4. Principles of evolutionary processes. 5. Principles of genetics. 6. A history of evolutionary computation. PART 3 EVOLUTIONARY ALGORITHMS AND THEIR STANDARD INSTANCES. 7. Introduction to evolutionary algorithms. 8. Genetic algorithms. 9. Evolution strategies. 10. Evolutionary programming. 11. Derivative methods in genetic programming. 12. Learning classifier systems. 13. Hybrid methods. PART 4. REPRESENTATIONS. 14. Introduction to representations. 15. Binary strings. 16. Real-valued vectors. 17. Permutations. 18. Finite-state representations. 19. Parse trees. 20. Guidelines for a suitable encoding. 21. Other representations. PART 5. SELECTION. 22. Introduction to selection. 23. Proportionary selection and sampling algorithms. 24. Tournament selection. 25. Rank-based selection. 26. Boltzmann selection. 27. Other selection methods. 28. Generation gap methods. 29. A comparison of selection mechanisms. 30. Interactive evolution. PART 6. SEARCH OPERATORS. 31. Introduction to search operators. 32. Mutation operators. 33. Recombination. 34. Other operators. Index.


Best Sellers


Product Details
  • ISBN-13: 9780750306645
  • Publisher: Taylor & Francis Ltd
  • Publisher Imprint: Institute of Physics Publishing
  • Height: 234 mm
  • No of Pages: 378
  • Weight: 630 gr
  • ISBN-10: 0750306645
  • Publisher Date: 01 Jan 2000
  • Binding: Paperback
  • Language: English
  • Sub Title: Basic Algorithms and Operators
  • Width: 156 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Evolutionary Computation 1: Basic Algorithms and Operators
Taylor & Francis Ltd -
Evolutionary Computation 1: Basic Algorithms and Operators
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Evolutionary Computation 1: Basic Algorithms and Operators

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!