State-Space Search: Algorithms, Complexity, Extensions, and Applications - Softcover

Zhang, Weixiong

Softcover

ISBN 10: 1461271835 ISBN 13: 9781461271833

Verlag: Springer, 2012

Inhaltsangabe

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. 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.

Über diesen Titel

Reseña del editor

This book is particularly concerned with heuristic state-space search for combinatorial optimization. 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. Primarily written for researchers in computer science, the author presupposes a basic familiarity with complexity theory, and it is assumed that the reader is familiar with the basic concepts of random variables and recursive functions. Two successful 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 forward estimation for constructing more informative evaluation functions.

Details zur Ausgabe

• Verlag: Springer
• Erscheinungsdatum: 2012
• Sprache: Englisch
• ISBN 10: 1461271835
• ISBN 13: 9781461271833
• Einband: Tapa blanda
• Anzahl der Seiten: 220
• Kontakt zum Hersteller: Nicht verfügbar
• Verantwortliche Person: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Deutschland