Librería: Second Story Books, ABAA, Rockville, MD, Estados Unidos de America
EUR 26,53
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. 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.
Librería: Phatpocket Limited, Waltham Abbey, HERTS, Reino Unido
EUR 30,81
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Publicado por Secaucus, New Jersey, U.S.A.: Springer Verlag, 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Idioma: Inglés
Librería: Rob the Book Man, Vancouver, WA, Estados Unidos de America
EUR 44,22
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Very Good. hardcover in very good + condition. name on inside cover, otherwise clean.
Librería: Basi6 International, Irving, TX, Estados Unidos de America
EUR 73,60
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
EUR 73,60
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: ALLBOOKS1, Direk, SA, Australia
EUR 81,80
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 102,35
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 102,64
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 104,16
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 102,98
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: NEPO UG, Rüsselsheim am Main, Alemania
EUR 87,91
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: 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.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 121,56
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 121,78
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: BennettBooksLtd, San Diego, NV, Estados Unidos de America
EUR 120,68
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: New. In shrink wrap. Looks like an interesting title!
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 115,72
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 115,72
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 112,46
Convertir monedaCantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 115,71
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 127,73
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Publicado por Springer New York, Springer New York, 2012
ISBN 10: 1461271835 ISBN 13: 9781461271833
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 109,94
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Publicado por Springer-Verlag New York Inc, 2013
ISBN 10: 1461271835 ISBN 13: 9781461271833
Idioma: Inglés
Librería: Revaluation Books, Exeter, Reino Unido
EUR 152,00
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 217 pages. 9.25x6.10x0.50 inches. In Stock.
Publicado por Springer New York, Springer US, 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 114,36
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: 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.
Librería: Buchpark, Trebbin, Alemania
EUR 79,12
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Gut. Zustand: Gut | Sprache: Englisch | Produktart: Bücher.
Librería: Buchpark, Trebbin, Alemania
EUR 80,93
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.
Publicado por Springer-Verlag New York Inc., 1999
ISBN 10: 0387988327 ISBN 13: 9780387988320
Idioma: Inglés
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 135,93
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 528.