University of Cebu-Banilad Library

Includes bibliographical references, index.

Contents: Preface — Acknowledgements — 1. Introduction — 2. Search spaces — 3. Blind search — 4. Heuristic search — 5. Sochastic local search — 6. Algorithm A* and variations — 7. Problem decomposition — 8. Chess and other games — 9. Automated planning — 10. Deduction as search — 11. Search in machine learning by Sutanu Chakraborti — 12. Constraint satisfaction — Appendix: Algorithm and pseudocode conventions by S. Baskaran — References — Index.

"This book is designed to provide in-depth knowledge on how search plays a fundamental role in problem solving. Meant for undergraduate and graduate students pursuing courses in computer science and artificial intelligence, it covers a wide spectrum of search methods. Readers will be able to begin with simple approaches and gradually progress to more complex algorithms applied to a variety of problems. It demonstrates that search is all pervasive in artificial intelligence and equips the reader with the relevant skills. The text starts with an introduction to intelligent agents and search spaces. Basic search algorithms like depth first search and breadth first search are the starting points. Then, it proceeds to discuss heuristic search algorithms, stochastic local search, algorithm A*, and problem decomposition. It also examines how search is used in playing board games, deduction in logic and automated planning. The book concludes with a coverage on constraint satisfaction." —Provided by the publisher

Adult

Purchased Ortega, Eric College of Computer Studies Computer Science

Text in English