• Title: Clever Algorithms: Nature-Inspired Programming Recipes
• Author(s) Jason Brownlee
• Publisher: lulu.com (June 15, 2012)
• Paperback: 436 pages
• eBook: PDF (436 pages)
• Language: English
• ISBN-10: 1446785068
• ISBN-13: 978-1446785065
• Share This:  

Book Description

The book describes 45 algorithms from the field of Artificial Intelligence. All algorithm descriptions are complete and consistent to ensure that they are accessible, usable and understandable by a wide audience.

This book provides a handbook of algorithmic recipes from the fields of Metaheuristics, Biologically Inspired Computation and Computational Intelligence that have been described in a complete, consistent, and centralized manner. These standardized descriptions were carefully designed to be accessible, usable, and understandable.

Most of the algorithms described in this book were originally inspired by biological and natural systems, such as the adaptive capabilities of genetic evolution and the acquired immune system, and the foraging behaviors of birds, bees, ants and bacteria.

An encyclopedic algorithm reference, this book is intended for research scientists, engineers, students, and interested amateurs. Each algorithm description provides a working code example in the Ruby Programming Language.

• Dr Jason Brownlee's passion for programming and artificial intelligence manifest early in the development of open source computer game modifications and tutorials.

• Amazon

• Algorithms and Data Structures
• Artificial Intelligence, Machine Learning, and Logic Programming
• Ruby Programming
• Computational Complexity

• Clever Algorithms: Nature-Inspired Programming Recipes (Jason Brownlee)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF

• Evolutionary Algorithms (Eisuke Kita)
• Planning Algorithms (Steven M. LaValle)
• Text Algorithms (Maxime Crochemore and Wojciech Rytter)

• The Design of Approximation Algorithms (D. P. Williamson)

  This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization, etc.

• Planning Algorithms (Steven M. LaValle)

  This is the only book for teaching and referencing of Planning Algorithms in applications including robotics, computational biology, computer graphics, manufacturing, aerospace applications and medicine, etc.

• A Field Guide to Genetic Programming (Riccardo Poli, et al)

  It provides a complete and coherent review of the theory of Genetic Programming (GP), written by three of the most active scientists in GP. GP solves problems without the user having to know or specify the form or structure of solutions in advance.

• Parallel Algorithms (Henri Casanova, et al)

  Focusing on algorithms for distributed-memory parallel architectures, the book extracts fundamental ideas and algorithmic principles from the mass of parallel algorithm expertise and practical implementations developed over the last few decades.

• Numerical Algorithms: Computer Vision, Machine Learning, etc.

  This book presents a new approach to numerical analysis for modern computer scientists, covers a wide range of topics - from numerical linear algebra to optimization and differential equations - focusing on real-world motivation and unifying themes.