Carte State-Space Search Weixiong Zhang

State-Space Search

Algorithms, Complexity, Extensions, and Applications

Limbă: engleză
Legare: Copertă tare
Disponibilitate: În depozitul extern
Expediem în 10-13 zile
551.82 lei
This book is about problem-solving. In particular it is about heuristic state-space search for combi...

Informații despre carte

Limbă
engleză
Legare
Carte - Copertă tare
Publicat
1999
Pagini
201
EAN
9780387988320
ISBN
0387988327
Enbook ID
01385659
Greutate
1100
Dimensiuni
155 x 235 x 17

Descriere completă

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.

S-ar putea să te intereseze

180.64 lei

Bentear

George Lilly
98.54 lei

Journey

Gail Earl
134.44 lei
58.59 lei
50.83 lei
320.14 lei

Jewish Cultural Studies

Bronner Simon J. Bronner
503.31 lei

Clienții care au cumpărat această carte au mai cumpărat și

247.01 lei
59.40 lei
48.71 lei
11.08 lei