Articles liés à State-Space Search: Algorithms, Complexity, Extensions,...
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer
- Date d'édition2012
- ISBN 10 1461271835
- ISBN 13 9781461271833
- ReliureBroché
- Langueanglais
- Nombre de pages220
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 80,20
EUR 11 expédition depuis Allemagne vers France
Destinations, frais et délais
Résultats de recherche pour State-Space Search: Algorithms, Complexity, Extensions,...
Image d'archives
State-Space Search : Algorithms, Complexity, Extensions, and Applications
Edité par
Springer New York, 2012
ISBN 10 : 1461271835
ISBN 13 : 9781461271833
Ancien ou d'occasion
Couverture souple
Vendeur : Buchpark, Trebbin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Sehr gut. Zustand: Sehr gut | Seiten: 220 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 24220486/2
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
State-Space Search
Edité par
Springer New York Sep 2012, 2012
ISBN 10 : 1461271835
ISBN 13 : 9781461271833
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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 réf. du vendeur 9781461271833
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
State-Space Search
Edité par
Springer New York, 2012
ISBN 10 : 1461271835
ISBN 13 : 9781461271833
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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 réf. du vendeur 4189813
Quantité disponible : Plus de 20 disponibles
Image d'archives
State-Space Search : Algorithms, Complexity, Extensions, and Applications
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9781461271833
Quantité disponible : 10 disponible(s)
Image fournie par le vendeur
State-Space Search : Algorithms, Complexity, Extensions, and Applications
Edité par
Springer New York, Springer New York, 2012
ISBN 10 : 1461271835
ISBN 13 : 9781461271833
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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 réf. du vendeur 9781461271833
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
State-Space Search
Edité par
Springer New York, Springer New York Sep 2012, 2012
ISBN 10 : 1461271835
ISBN 13 : 9781461271833
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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 réf. du vendeur 9781461271833
Quantité disponible : 1 disponible(s)
Image d'archives
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781461271833_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Edité par
Springer-Verlag New York Inc., 2012
ISBN 10 : 1461271835
ISBN 13 : 9781461271833
Neuf
Paperback / softback
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 348. N° de réf. du vendeur C9781461271833
Quantité disponible : Plus de 20 disponibles
Image d'archives
State-space Search: Algorithms, Complexity, Extensions, and Applications
Edité par
Springer-Verlag New York Inc, 2013
ISBN 10 : 1461271835
ISBN 13 : 9781461271833
Neuf
Paperback
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 217 pages. 9.25x6.10x0.50 inches. In Stock. N° de réf. du vendeur x-1461271835
Quantité disponible : 2 disponible(s)
Image d'archives
State-Space Search: Algorithms, Complexity, Extensions, and Applications
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar2716030028613
Quantité disponible : Plus de 20 disponibles