Advances in Evolutionary Computing
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Advances in Evolutionary Computing: Theory and Applications
Advances in Evolutionary Computing: Theory and Applications

Advances in Evolutionary Computing: Theory and Applications

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

The term evolutionary computing refers to the study of the foundations and applications of certain heuristic techniques based on the principles of natural evolution; thus the aim of designing evolutionary algorithms (EAs) is to mimic some of the processes taking place in natural evolution. These algo­ rithms are classified into three main categories, depending more on historical development than on major functional techniques. In fact, their biological basis is essentially the same. Hence EC = GA uGP u ES uEP EC = Evolutionary Computing GA = Genetic Algorithms,GP = Genetic Programming ES = Evolution Strategies,EP = Evolutionary Programming Although the details of biological evolution are not completely understood (even nowadays), there is some strong experimental evidence to support the following points: • Evolution is a process operating on chromosomes rather than on organ­ isms. • Natural selection is the mechanism that selects organisms which are well­ adapted to the environment toreproduce more often than those which are not. • The evolutionary process takes place during the reproduction stage that includes mutation (which causes the chromosomes of offspring to be dif­ ferent from those of the parents) and recombination (which combines the chromosomes of the parents to produce the offspring). Based upon these features, the previously mentioned three models of evolutionary computing were independently (and almost simultaneously) de­ veloped. An evolutionary algorithm (EA) is an iterative and stochastic process that operates on a set of individuals (called a population).

Table of Contents:
I.- Smoothness, Ruggedness and Neutrality of Fitness Landscapes: from Theory to Application.- Fast Evolutionary Algorithms.- Visualizing Evolutionary Computation.- New Schemes of Biologically Inspired Evolutionary Computation.- On the Design of Problem-specific Evolutionary Algorithms.- Multiparent Recombination in Evolutionary Computing.- TCG-2: A Test-case Generator for Non-linear Parameter Optimisation Techniques.- A Real-coded Genetic Algorithm Using the Unimodal Normal Distribution Crossover.- Designing Evolutionary Algorithms for Dynamic Optimization Problems.- Multi-objective Evolutionary Algorithms: Introducing Bias Among Pareto-optimal Solutions.- Gene Expression and Scalable Genetic Search.- Solving Permutation Problems with the Ordering Messy Genetic Algorithm.- Effects of Adding Perturbations to Phenotypic Parameters in Genetic Algorithms for Searching Robust Solutions.- Evolution of Strategies for Resource Protection Problems.- A Unified Bayesian Framework for EvolutionaryLearning and Optimization.- Designed Sampling with Crossover Operators.- Evolutionary Computation for Evolutionary Theory.- Computational Embryology: Past, Present and Future.- An Evolutionary Approach to Synthetic Biology: Zen in the Art of Creating Life.- Scatter Search.- The Ant Colony Optimization Paradigm for Combinatorial Optimization.- Evolving Coordinated Agents.- Exploring the Predictable.- II.- Approaches to Combining Local and Evolutionary Search for Training Neural Networks: A Review and Some New Results.- Evolving Analog Circuits by Variable Length Chromosomes.- Human-competitive Applications of Genetic Programming.- Evolutionary Algorithms for the Physical Design of VLSI Circuits.- From Theory to Practice: An Evolutionary Algorithm for the Antenna Placement Problem.- Routing Optimization in Corporate Networks by Evolutionary Algorithms.- Genetic Algorithms and Timetabling.- Machine Learning by Schedule Decomposition — Prospects for an Integration of AI and OR Techniquesfor Job Shop Scheduling.- Scheduling of Bus Drivers’ Service by a Genetic Algorithm.- A Survey of Evolutionary Algorithms for Data Mining and Knowledge Discovery.- Data Mining from Clinical Data Using Interactive Evolutionary Computation.- Learning-integrated Interactive Image Segmentation.- An Immunogenetic Approach in Chemical Spectrum Recognition.- Application of Evolutionary Computation to Protein Folding.- Evolutionary Generation of Regrasping Motion.- Recent Trends in Learning Classifier Systems Research.- Better than Samuel: Evolving a Nearly Expert Checkers Player.


Best Sellers


Product Details
  • ISBN-13: 9783642623868
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 1006
  • Sub Title: Theory and Applications
  • ISBN-10: 3642623867
  • Publisher Date: 06 Nov 2012
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Advances in Evolutionary Computing: Theory and Applications
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Advances in Evolutionary Computing: Theory and Applications
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.

Advances in Evolutionary Computing: Theory and Applications

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!