Handbook of Bioinspired Algorithms and Applications / Edition 1

Hardcover (Print)
Buy Used
Buy Used from BN.com
(Save 37%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $29.95
Usually ships in 1-2 business days
(Save 84%)
Other sellers (Hardcover)
  • All (5) from $29.95   
  • New (2) from $121.40   
  • Used (3) from $29.95   
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
Seller since 2008

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.


Ships from: Chicago, IL

Usually ships in 1-2 business days

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

Feedback rating:


Condition: New
2015 Hardback NEW 9781584884750 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Print on Demand title, ... produced to the highest standard, and there would be a delay in dispatch of around 15 working days. *****PLEASE NOTE: This item is shipping from an authorized seller in Europe. In the event that a return is necessary, you will be able to return your item within the US. To learn more about our European sellers and policies see the BookQuest FAQ section***** Read more Show Less

Ships from: Stroud, Glos, United Kingdom

Usually ships in 1-2 business days

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


The mystique of biologically inspired (or bioinspired) paradigms is their ability to describe and solve complex relationships from intrinsically very simple initial conditions and with little or no knowledge of the search space. Edited by two prominent, well-respected researchers, the Handbook of Bioinspired Algorithms and Applications reveals the connections between bioinspired techniques and the development of solutions to problems that arise in diverse problem domains.

A repository of the theory and fundamentals as well as a manual for practical implementation, this authoritative handbook provides broad coverage in a single source along with numerous references to the available literature for more in-depth information. The book's two sections serve to balance coverage of theory and practical applications. The first section explains the fundamentals of techniques, such as evolutionary algorithms, swarm intelligence, cellular automata, and others. Detailed examples and case studies in the second section illustrate how to apply the theory in actually developing solutions to a particular problem based on a bioinspired technique.

Emphasizing the importance of understanding and harnessing the robust capabilities of bioinspired techniques for solving computationally intractable optimizations and decision-making applications, the Handbook of Bioinspired Algorithms and Applications is an absolute must-read for anyone who is serious about advancing the next generation of computing.

Read More Show Less

Product Details

Table of Contents

Evolutionary Algorithms; E. Alba and C. Cotta
An Overview of Neural Networks Models; J. Taheri and A.Y. Zomaya
Ant Colony Optimization; M. Guntsch and J. Branke
Swarm Intelligence; M. Belal, J. Gaber, H. El-Sayed, and A. Almojel
Parallel Genetic Programming: Methodology, History, and Application to Real-Life Problems; F. Fernández de Vega
Parallel Cellular Algorithms and Programs; D. Talia
Decentralized Cellular Evolutionary Algorithms; E. Alba, B. Dorronsoro, M. Giacobino, and M. Tomassini
Optimization via Gene Expression Algorithms; F. Burkowski
Dynamic Updating DNA Computing Algorithms; Z.F. Qiu and M. Lu
A Unified View on Metaheuristics and Their Hybridization; J. Branke, M. Stein, and H. Schmeck
The Foundations of Autonomic Computing; S. Hariri, B. Khargaria, M. Parashar, and Z. Li
Setting Parameter Values for Parallel Genetic Algorithms: Scheduling Tasks on a Cluster; M. Moore
Genetic Algorithms for Scheduling in Grid Computing Environments: A Case Study; K. Crnomarkovic and A.Y. Zomaya
Minimization of SADMs in Unidirectional SONET/WDM Rings Using Genetic Algorithms; A. Mukhopadhyay, U. Biswas, M.K. Naskar, U. Maulik, and S. Bandyopadhyay,
Solving Optimization Problems in Wireless Networks Using Genetic Algorithms; S.K. Das, N. Banerjee, and A. Roy
Medical Imaging and Diagnosis Using Genetic Algorithms; U. Maulik, S. Bandyopadhyay, S.K. Das
Scheduling and Rescheduling with Use of Cellular Automata; F. Seredynski, A. Swiecicka, and A.Y. Zomaya
Cellular Automata, PDEs, and Pattern Formation; X-S. Yang, Y. Young
Ant Colonies and the Mesh-Partitioning Problem; B. Robic, P. Korošec, and J. Šilc
Simulating the Strategic Adaptation of Organizations Using OrgSwarm; A. Brabazon, A. Silva, E. Costa, T. Ferra de Sousa, and M. O'Neill
BeeHive: New Ideas for Developing Routing Algorithms Inspired by Honey Bee Behavior; H.F. Wedde and M. Farooq
Swarming Agents for Decentralized Clustering in Spatial Data; G. Folino, A. Forestiero, and G. Spezzano
Biological Inspired Based Intrusion Detection Models for Mobile Telecommunication Systems; A. Boukerche, K.R.L. Jucá, J.B.M. Sobral, and M.S.M.A. Notare
Synthesis of Multiple-Valued Circuits by Neural Networks; A. Ngom and I. Stojmenovic
On the Computing Capacity of Multiple-Valued Multiple-Threshold Perceptrons; A. Ngom, I. Stojmenovic, and J. Žunic
Advanced Evolutionary Algorithms for Training Neural Networks; E. Alba, J.F. Chicano, F. Luna, G. Luque, and A.J. Nebro
Bio-Inspired Data Mining; T. Sousa, A. Silva, A. Neves, and E. Costa
A Hybrid Evolutionary Algorithm for Knowledge Discovery in Microarray Experiments; L. Jourdan, M. Khabzaoui, C. Dhaenens, and E-G. Talbi
An Evolutionary Approach to Problems in Electrical Engineering Design; G. Papa, J. Šilc, and B. Koroušic-Seljak
Solving the Partitioning Problem in Distributed Virtual Environment Systems Using Evolutive Algorithms; P. Morillo, M. Fernandez, and J.M. Orduña
Population Learning Algorithm and Its Applications; P. Jedrzejowicz
Biology-Derived Algorithms in Engineering Optimization; X-S. Yang
Biomimetic Models for Wireless Sensor Networks; K.H. Jones, K.N. Lodding, S. Olariu, A. Wadaa, L. Wilson, and M. Eltoweissy
A Cooperative Parallel Metaheuristic Applied to the Graph Coloring Problem; B. Weinberg and E-G. Talbi
Frameworks for the Design of Reusable Parallel and Distributed Metaheuristics; N. melba, E-G. Talbi, and S. Cahon
Parallel Hybrid Multiobjective Metaheuristics on P2P Systems; N. Melab, E-G. Talbi, M. Mezmaz, and B. Wei

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 & 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


  • - 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)