DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
LIFE has become richer by the love that has been lost.
ISBN10: 0387988327, ISBN13: 9780387988320, [publisher: Springer, New York] Hardcover Octavo, xvi, 201 pages. In Good condition. Spine is silver with brown print. Boards in glossy illustrated paper. Light wear to spine caps, remains of small vendor label on rear. Text block has mark in red ink on bottom edge. Illustrated: b&w graphs, tables, charts. NOTE: Shelved in Netdesk Column G. 1379275. FP New Rockville Stock. [Rockville, MD, U.S.A.] [Publication Year: 1999]
New York: Springer, Date: 1999. Hardcover. Octavo, xvi, 201 pages. In Good condition. Spine is silver with brown print. Boards in glossy illustrated paper. Light wear to spine caps, remains of small vendor label on rear. Text block has mark in red ink on bottom edge. Illustrated: b&w graphs, tables, charts. NOTE: Shelved in Netdesk Column G. 1379275. FP New Rockville Stock. 1999. Springer ISBN 0387988327 US
New York: Springer, Date: 1999. Hardcover. Octavo, xvi, 201 pages. In Good condition. Spine is silver with brown print. Boards in glossy illustrated paper. Light wear to spine caps, remains of small vendor label on rear. Text block has mark in red ink on bottom edge. Illustrated: b&w graphs, tables, charts. NOTE: Shelved in Netdesk Column G. 1379275. FP New Rockville Stock. 1999. Springer ISBN 0387988327 9780387988320 [US]
New York Springer 1999 1999 ed. Hardcover Book. Octavo, xvi, 201 pages. In Good condition. Spine is silver with brown print. Boards in glossy illustrated paper. Light wear to spine caps, remains of small vendor label on rear. Text block has mark in red ink on bottom edge. Illustrated: b&w graphs, tables, charts. NOTE: Shelved in Netdesk Column G. 1379275. FP New Rockville Stock.
ISBN10: 0387988327, ISBN13: 9780387988320, [publisher: Springer, New York] Hardcover Octavo, xvi, 201 pages. In Good condition. Spine is silver with brown print. Boards in glossy illustrated paper. Light wear to spine caps, remains of small vendor label on rear. Text block has mark in red ink on bottom edge. Illustrated: b&w graphs, tables, charts. NOTE: Shelved in Netdesk Column G. 1379275. FP New Rockville Stock. [Rockville, MD, U.S.A.] [Publication Year: 1999]
Secaucus, New Jersey, U.S.A.: Springer Verlag, Date: 1999. hardcover in very good + condition. name on inside cover, otherwise clean. Hardcover. Very Good. 1999. Secaucus, New Jersey, U.S.A.: Springer Verlag ISBN 0387988327 9780387988320 [US]
Secaucus, New Jersey, U.S.A. : Springer Verlag 1999 1999 ed. Hardcover Very Good Hardcover in very good + condition. name on inside cover, otherwise clean.
ISBN10: 0387988327, ISBN13: 9780387988320, [publisher: Secaucus, New Jersey, U.S.A.: Springer Verlag] Hardcover hardcover in very good + condition. name on inside cover, otherwise clean [Vancouver, WA, U.S.A.] [Publication Year: 1999]
ISBN10: 0387988327, ISBN13: 9780387988320, [publisher: Springer 01.11.1999.] Hardcover 201 Seiten ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 469 24,1 x 16,1 x 1,6 cm, Gebundene Ausgabe [Rüsselsheim am Main, Germany] [Publication Year: 1999]
ISBN10: 0387988327, ISBN13: 9780387988320, [publisher: Springer 01.11.1999.] Hardcover 201 Seiten ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 469 24,1 x 16,1 x 1,6 cm, Gebundene Ausgabe [Rüsselsheim am Main, Germany] [Publication Year: 1999]
ISBN10: 0387988327, ISBN13: 9780387988320, [publisher: Springer New York] Hardcover Druck auf Anfrage Neuware - Printed after ordering - 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 is one of the best techniques for optimally solving computation-intensive problems, such as scheduling and planning. The main search algorithms considered include best-first search, depth first branch-and-bound, iterative deepening, recursive best-first search, and space-bounded best-first search. Best-first search and depth-first branch-and-bound are very well known and have been used extensively in Computer Science and Operations Research. One important feature of depth-first branch-and-bound is that it only requires space this is linear in the maximal search depth, makin ...
ISBN10: 0387988327, ISBN13: 9780387988320, [publisher: Springer New York] Hardcover Druck auf Anfrage Neuware - Printed after ordering - 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 is one of the best techniques for optimally solving computation-intensive problems, such as scheduling and planning. The main search algorithms considered include best-first search, depth first branch-and-bound, iterative deepening, recursive best-first search, and space-bounded best-first search. Best-first search and depth-first branch-and-bound are very well known and have been used extensively in Computer Science and Operations Research. One important feature of depth-first branch-and-bound is that it only requires space this is linear in the maximal search depth, makin ...
Hard Cover. New. New Book; Fast Shipping from UK; Not signed; Not First Edition; The State-Space Search : Algorithms, Complexity, Extensions, and Applications. ISBN 0387988327 9780387988320 [GB]
ISBN10: 0387988327, ISBN13: 9780387988320, [publisher: Springer] Hardcover New Copy. Customer Service Guaranteed [Denver, CO, U.S.A.] [Publication Year: 1999]
DISCLOSURE:
When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.
