Artículos relacionados a State-Space Search: Algorithms, Complexity, Extensions,...
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialSpringer
- Año de publicación2012
- ISBN 10 1461271835
- ISBN 13 9781461271833
- EncuadernaciónTapa blanda
- IdiomaInglés
- Número de páginas220
- Contacto del fabricanteno disponible
Comprar nuevo
Ver este artículo
EUR 80,20
EUR 11,00 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para State-Space Search: Algorithms, Complexity, Extensions,...
Imagen de archivo
State-Space Search : Algorithms, Complexity, Extensions, and Applications
Publicado por
Springer New York, 2012
ISBN 10: 1461271835
ISBN 13: 9781461271833
Antiguo o usado
Tapa blanda
Librería: Buchpark, Trebbin, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: Sehr gut. Zustand: Sehr gut | Seiten: 220 | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 24220486/2
Cantidad disponible: 1 disponibles
Imagen del vendedor
State-Space Search
Publicado por
Springer New York Sep 2012, 2012
ISBN 10: 1461271835
ISBN 13: 9781461271833
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: 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. Nº de ref. del artículo: 9781461271833
Cantidad disponible: 2 disponibles
Imagen de archivo
State-Space Search : Algorithms, Complexity, Extensions, and Applications
Librería: Chiron Media, Wallingford, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PF. Condición: New. Nº de ref. del artículo: 6666-IUK-9781461271833
Cantidad disponible: 10 disponibles
Imagen del vendedor
State-Space Search
Impresión bajo demandaLibrería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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. Nº de ref. del artículo: 4189813
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
State-Space Search : Algorithms, Complexity, Extensions, and Applications
Publicado por
Springer New York, Springer New York, 2012
ISBN 10: 1461271835
ISBN 13: 9781461271833
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. 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. Nº de ref. del artículo: 9781461271833
Cantidad disponible: 1 disponibles
Imagen de archivo
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9781461271833_new
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
State-Space Search
Publicado por
Springer New York, Springer New York Sep 2012, 2012
ISBN 10: 1461271835
ISBN 13: 9781461271833
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. 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 220 pp. Englisch. Nº de ref. del artículo: 9781461271833
Cantidad disponible: 1 disponibles
Imagen de archivo
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Publicado por
Springer-Verlag New York Inc., 2012
ISBN 10: 1461271835
ISBN 13: 9781461271833
Nuevo
Paperback / softback
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 348. Nº de ref. del artículo: C9781461271833
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
State-space Search: Algorithms, Complexity, Extensions, and Applications
Publicado por
Springer-Verlag New York Inc, 2013
ISBN 10: 1461271835
ISBN 13: 9781461271833
Nuevo
Paperback
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 217 pages. 9.25x6.10x0.50 inches. In Stock. Nº de ref. del artículo: x-1461271835
Cantidad disponible: 2 disponibles
Imagen de archivo
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar2716030028613
Cantidad disponible: Más de 20 disponibles