{"product_id":"9781461271833","title":"State-Space Search: Algorithms, Complexity, Extensions, and Applications","description":"\u003ch1\u003eState-Space Search: Algorithms, Complexity, Extensions, and Applications\u003c\/h1\u003e \u003ch2\u003eZhang, Weixiong\u003c\/h2\u003e \u003cp\u003eThis 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.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2012-09-27\u003c\/p\u003e \u003cp\u003eFormat: Paperback\u003c\/p\u003e \u003cp\u003e ISBN-10: 9781461271833\u003c\/p\u003e \u003cp\u003eISBN-13: 9781461271833\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/978-1-4612-1538-7\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 201\u003c\/p\u003e ","brand":"Springer","offers":[{"title":"Default Title","offer_id":44358749913228,"sku":"9781461271833","price":99.0,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9781461271833.jpg?v=1755113335","url":"https:\/\/lateknightbooks.com\/products\/9781461271833","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}