Heuristic Search: Theory and Applications


Product Description
Search has been vital to artificial intelligence from the very beginning as a core technique in problem solving. The authors present a thorough overview of heuristic search with a balance of discussion between theoretical analysis and efficient implementation and application to real-world problems. Current developments in search such as pattern databases and search with efficient use of external memory and parallel processing units on main boards and graphics cards are detailed.
Heuristic search as a problem solving tool is demonstrated in applications for puzzle solving, game playing, constraint satisfaction and machine learning. While no previous familiarity with heuristic search is necessary the reader should have a basic knowledge of algorithms, data structures, and calculus. Real-world case studies and chapter ending exercises help to create a full and realized picture of how search fits into the world of artificial intelligence and the one around us.
*Provides real-world success stories and case studies for heuristic search algorithms *Includes many AI developments not yet covered in textbooks such as pattern databases, symbolic search, and parallel processing units
</p>Heuristic Search: Theory and Applications Review
This book is a great collection of a huge amount of search, of topics relavant to computational intelligence.Different from my expectation, despite its thick volume, just a few core or important techniques prevail over this book, like BFS, DFS, A*, ..., mixing with articles on artificial or computational intelligence.
It's true that this book provides lots of things to know to understand heuristic search, but I think it needs to reduce and focus its major subjects or to change the way to explain.
Good book.
Most of the consumer Reviews tell that the "Heuristic Search: Theory and Applications" are high quality item. You can read each testimony from consumers to find out cons and pros from Heuristic Search: Theory and Applications ...

No comments:
Post a Comment