Stock image for illustration purposes only - book cover, edition or condition may vary.
State Space Search
Weixiong Zhang
€ 123.12
FREE Delivery in Ireland
Description for State Space Search
Hardback. Provides information on heuristic state-space search for combinatorial optimization, one of the fundamental problems of computer science. Written for researchers in computer science, this book presupposes a familiarity with complexity theory, assuming that the reader is familiar with the basic concepts of random variables and recursive functions. Num Pages: 201 pages, biography. BIC Classification: PBWH; UYA. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 14. Weight in Grams: 498.
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 ... Read more
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 ... Read more
Product Details
Format
Hardback
Publication date
1999
Publisher
Springer-Verlag New York Inc. United States
Number of pages
201
Condition
New
Number of Pages
201
Place of Publication
New York, NY, United States
ISBN
9780387988320
SKU
V9780387988320
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15
Reviews for State Space Search