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.
"synopsis" may belong to another edition of this title.
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 220 pp. Englisch. Seller Inventory # 9781461271833
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar2716030028613
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9781461271833_new
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9781461271833
Quantity: 10 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 tec. Seller Inventory # 4189813
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 222. Seller Inventory # 2697513183
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 217 pages. 9.25x6.10x0.50 inches. In Stock. Seller Inventory # x-1461271835
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Print on Demand pp. 222 51 Illus. Seller Inventory # 95965440
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. State-Space Search | Algorithms, Complexity, Extensions, and Applications | Weixiong Zhang | Taschenbuch | xvi | Englisch | 2012 | Springer | EAN 9781461271833 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 105639905
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 222. Seller Inventory # 1897513173