Mohlo by se vám také líbit

Více informací o knize State-Space Search

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 236 bodů

Anotace knihy

This book is about problem-solving. In particular it is about heuristic state-space search for combinatorial optimization - one of the fundamental problems of computer science. Its two central themes are the average-case complexity of state-space search algorithms and the applications of the results notably to branch-and-bound techniques. These include best-first search, depth-first branch-and- bound, iterative deepening, recursive best-first search, and constant- space best-first search. Primarily written for researchers in computer science, the author presupposes a basic familiarity with complexity theory. In addition, it is assumed that the reader is familiar with the basic concepts of random variables and recursive functions. Two succesful applications are presented in depth: one is a set of state-space transformation methods which can be used to find approximate solutions quickly, and the second is a method called forward estimation for constructing more informative evaluation functions.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Applied mathematics

• Plný název: State-Space Search
• Podnázev: Algorithms, Complexity, Extensions, and Applications
• Autor: Weixiong Zhang
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 201
• EAN: 9780387988320
• ISBN: 0387988327
• ID: 01385659
• Nakladatelství: Springer-Verlag New York Inc.
• Hmotnost: 1100 g
• Rozměry: 235 × 155 × 17 mm
• Datum vydání: 14. October 1999

Oblíbené z jiného soudku

---

---

---