State-Space Search: Algorithms, Complexity, Extensions, and Applications - Weixiong Zhang
-35% koodilla BOOKS
Toimitus 17-23 arkipäivässä
30 päivän palautusoikeus
This book is about problem solving. Specifically, it is about heuristic state-space search under branch-and-bound framework for solving com binatorial optimization problems. The two central themes of this book are the average-case complexity of heuristic state-space search algorithms based on branch-and-bound, and their applications to developing new problem-solving methods and algorithms. Heuristic state- ... Täydellinen kuvaus
Saatat myös pitää
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
How To Think About AI: A Guide For The Perplexed
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
AI Engineering: Building Applications with Foundation Models
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
How to Talk to AI: (And How Not To)
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Art of Game Design: A Book of Lenses
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
How Linux Works: What Every Superuser Should Know
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Hands-On Large Language Models: Language Understanding and Generation
Maarten Grootendorst, Jay Alammar
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Clean Architecture: A Craftsman's Guide to Software Structure and Design
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
World of Warcraft Chronicle, Volume 2
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Deep Learning: Foundations and Concepts
Christopher M. Bishop, Hugh Bishop
-35% koodilla BOOKS
Toimittajalla varastossa
Kuvaus
This book is about problem solving. Specifically, it is about heuristic state-space search under branch-and-bound framework for solving com binatorial optimization problems. The two central themes of this book are the average-case complexity of heuristic state-space search algorithms based on branch-and-bound, and their applications to developing new problem-solving methods and algorithms. Heuristic state-space search is one of the fundamental problem-solving techniques in Computer Science and Operations Research, and usually constitutes an important component of most intelligent problem-solving systems. The search algorithms considered in this book can be classified into the category of branch-and-bound. Branch-and-bound is a general problem-solving paradigm, and is one of the best techniques for optimally solving computation-intensive problems, such as scheduling and planning. The main search algorithms considered include best-first search, depth first branch-and-bound, iterative deepening, recursive best-first search, and space-bounded best-first search. Best-first search and depth-first branch-and-bound are very well known and have been used extensively in Computer Science and Operations Research. One important feature of depth-first branch-and-bound is that it only requires space this is linear in the maximal search depth, making it very often a favorable search algo rithm over best-first search in practice. Iterative deepening and recursive best-first search are the other two linear-space search algorithms. Iterative deepening is an important algorithm in Artificial Intelligence, and plays an irreplaceable role in building a real-time game-playing program.
Lisätietoja
| Kirjoittaja | Weixiong Zhang |
|---|---|
| Julkaisija | Springer US |
| Julkaisuvuosi | 1999 |
| Kannen tyyppi | Kovakantinen |
| EAN | 9780387988320 |