Swarm Intelligence and Bio-inspired Computation

Swarm Intelligence and Bio-inspired Computation

Theory and Applications

eBook - 2013
Rate this:

Swarm Intelligence and bio-inspired computation have become increasing popular in the last two decades. Bio-inspired algorithms such as ant colony algorithms, bat algorithms, bee algorithms, firefly algorithms, cuckoo search and particle swarm optimization have been applied in almost every area of science and engineering with a dramatic increase of number of relevant publications. This book reviews the latest developments in swarm intelligence and bio-inspired computation from both the theory and application side, providing a complete resource that analyzes and discusses the latest and future trends in research directions. It can help new researchers to carry out timely research and inspire readers to develop new algorithms. With its impressive breadth and depth, this book will be useful for advanced undergraduate students, PhD students and lecturers in computer science, engineering and science as well as researchers and engineers.

Focuses on the introduction and analysis of key algorithms Includes case studies for real-world applications Contains a balance of theory and applications, so readers who are interested in either algorithm or applications will all benefit from this timely book.
Publisher: London ; Waltham, Mass. : Elsevier, 2013 (Norwood, Mass. : Books24x7.com [generator])
Edition: 1st ed
ISBN: 9780124051775
0124051634
9780124051638
Additional Contributors: Yang, Xin-She
Books24x7, Inc

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age Suitability

Add Age Suitability

There are no age suitabilities for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Subject Headings

  Loading...

Find it at VPL

  Loading...
[]
[]
To Top