Importo totale (1 articolo articoli):
Destinazione ordine:
weixiong zhang (39 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (39)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (26)
- Come nuovo, Ottimo o Quasi ottimo (7)
- Molto buono o Buono (5)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (1)
Legatura
Ulteriori caratteristiche
- Prima ed. (Nessun altro risultato corrispondente a questo perfezionamento)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (15)
- Non Print on Demand (30)
Lingua (2)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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
Da: Second Story Books, ABAA, Rockville, MD, U.S.A.
Membro dell'associazione: ABAA ILAB
Valutazione del venditore 4 su 5 stelle
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
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 24,75
EUR 12,12 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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
Editore: Secaucus, New Jersey, U.S.A.: Springer Verlag, 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Lingua: Inglese
Da: Rob the Book Man, Vancouver, WA, U.S.A.
Valutazione del venditore 4 su 5 stelle
Hardcover. Condizione: Very Good. hardcover in very good + condition. name on inside cover, otherwise clean.
-
State-Space Search - Algorithms, Complexity Extensions and Applications
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
State-Space Search - Algorithms, Complexity Extensions and Applications
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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.
-
EUR 81,58
Gratis per la spedizione da Australia a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 102,56
EUR 3,42 per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
State Space Search : Algorithms, Complexity, Extensions, and Applications
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 104,08
EUR 2,26 per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 102,89
EUR 3,42 per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Da: NEPO UG, Rüsselsheim am Main, Germania
Valutazione del venditore 5 su 5 stelle
EUR 87,91
EUR 24,00 per la spedizione da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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)
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 104,36
EUR 12,12 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 121,68
EUR 2,26 per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Da: BennettBooksLtd, San Diego, NV, U.S.A.
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!
-
State-Space Search : Algorithms, Complexity, Extensions, and Applications
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 111,30
EUR 17,64 per la spedizione da Regno Unito a U.S.A.Quantità: 10 disponibili
Aggiungi al carrelloPF. Condizione: New.
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 114,53
EUR 13,65 per la spedizione da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 114,53
EUR 13,65 per la spedizione da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
State Space Search : Algorithms, Complexity, Extensions, and Applications
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 114,52
EUR 17,09 per la spedizione da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
State Space Search : Algorithms, Complexity, Extensions, and Applications
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 126,41
EUR 17,09 per la spedizione da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Condizione: New. pp. 222.
-
State-space Search: Algorithms, Complexity, Extensions, and Applications
Editore: Springer-Verlag New York Inc, 2013
ISBN 10: 1461271835 ISBN 13: 9781461271833
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 150,64
EUR 11,39 per la spedizione da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 217 pages. 9.25x6.10x0.50 inches. In Stock.
-
EUR 95,55
EUR 70,00 per la spedizione da Germania a U.S.A.Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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
Editore: Springer New York, Springer US Okt 1999, 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Lingua: Inglese
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
EUR 106,99
EUR 60,00 per la spedizione da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: 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
Editore: Springer New York, Springer New York, 2012
ISBN 10: 1461271835 ISBN 13: 9781461271833
Lingua: Inglese
EUR 109,94
EUR 61,71 per la spedizione da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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
Editore: Springer New York, Springer US, 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Lingua: Inglese
EUR 114,36
EUR 62,56 per la spedizione da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: 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.
-
EUR 79,12
EUR 105,00 per la spedizione da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher.
-
EUR 80,93
EUR 105,00 per la spedizione da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.
-
Condizione: Fine. Size: A5 size.
-
Condizione: Fine. Size: A5 size.
-
Condizione: Fine. The book is in fine condition.
