Order Total (1 Item Items):
Shipping Destination:
Zhang Weixiong (38 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (38)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (25)
- As New, Fine or Near Fine (7)
- Very Good or Good (5)
- Fair or Poor (No further results match this refinement)
- As Described (1)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (15)
- Not Print on Demand (29)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
-
STATE-SPACE SEARCH : ALGORITHMS, COMPLEXITY, AND APPLICATIONS
Seller: Second Story Books, ABAA, Rockville, MD, U.S.A.
Seller rating 4 out of 5 stars
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.
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
-
State Space Search: Algorithms, Complexity, Extensions, and Applications
Published by Secaucus, New Jersey, U.S.A.: Springer Verlag, 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Language: English
Hardcover. Condition: Very Good. hardcover in very good + condition. name on inside cover, otherwise clean.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
-
-
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Published by Springer 01.11.1999., 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Language: English
Condition: Sehr gut. Auflage: 1999. 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.
-
Distributed Constraint Problem Solving and Reasoning in Multi-Agent Systems (Frontiers In Artificial Intellligence And Applications, 112)
Published by SAGE Publications Ltd, 2006
ISBN 10: 1586034561 ISBN 13: 9781586034566
Language: English
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
-
Condition: As New. Unread book in perfect condition.
-
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 132.06
US$ 15.73 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
US$ 132.06
US$ 15.73 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
PF. Condition: New.
-
State Space Search : Algorithms, Complexity, Extensions, and Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 132.04
US$ 19.70 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
State Space Search : Algorithms, Complexity, Extensions, and Applications
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 145.83
US$ 19.70 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Condition: New. pp. 222.
-
State-space Search: Algorithms, Complexity, Extensions, and Applications
Published by Springer-Verlag New York Inc, 2013
ISBN 10: 1461271835 ISBN 13: 9781461271833
Language: English
Paperback. Condition: Brand New. 217 pages. 9.25x6.10x0.50 inches. In Stock.
-
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.
-
State-Space Search
Published by Springer New York, Springer US Okt 1999, 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Language: English
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware -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, making it very often a favorable search algo rithm over best-first search in practice. Iterative deepening and recursive best-first search are the other two linear-space search algorithms. Iterative deepening is an important algorithm in Artificial Intelligence, and plays an irreplaceable role in building a real-time game-playing program.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch.
-
State-Space Search : Algorithms, Complexity, Extensions, and Applications
Published by Springer New York, Springer New York, 2012
ISBN 10: 1461271835 ISBN 13: 9781461271833
Language: English
Taschenbuch. Condition: Neu. 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, making it very often a favorable search algo rithm over best-first search in practice. Iterative deepening and recursive best-first search are the other two linear-space search algorithms. Iterative deepening is an important algorithm in Artificial Intelligence, and plays an irreplaceable role in building a real-time game-playing program.
-
State-Space Search : Algorithms, Complexity, Extensions, and Applications
Published by Springer New York, Springer US, 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Language: English
Buch. Condition: Neu. 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, making it very often a favorable search algo rithm over best-first search in practice. Iterative deepening and recursive best-first search are the other two linear-space search algorithms. Iterative deepening is an important algorithm in Artificial Intelligence, and plays an irreplaceable role in building a real-time game-playing program.
-
Condition: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher.
-
Condition: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.
-
Condition: Fine. Size: A5 size.
-
Condition: Fine. Size: A5 size.
-
Condition: Fine. The book is in fine condition.
-
State-Space Search
Published by Springer New York Sep 2012, 2012
ISBN 10: 1461271835 ISBN 13: 9781461271833
Language: English
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
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.
