Fault-Tolerant Search Algorithms Reliable Computation with Unreliable Information

Idioma: inglés

Editorial: Springer, 2013

3642173268 / 9783642173264

Librería: Home-set, Mannheim, AlemaniaHome-set

Vendedor de 5 estrellas

Vendedor de IberLibro desde 13 de abril de 2026

Tapa dura

Condición: Nuevo

EUR 66,86

Envío por EUR 49,90 
Se envía de Alemania a Estados Unidos de America

Cantidad disponible: 2 disponibles

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

Why a book on fault-tolerant search algorithms? Searching is one of the fundamental problems in computer science. Time and again algorithmic and combinatorial issues originally studied in the context of search find application in the most diverse areas of computer science and discrete mathematics. On the other hand, fault-tolerance is a necessary ingredient of computing. Due to their inherent complexity, information systems are naturally prone to errors, which may appear at any level - as imprecisions in the data, bugs in the software, or transient or permanent hardware failures. This book provides a concise, rigorous and up-to-date account of different approaches to fault-tolerance in the context of algorithmic search theory. Thanks to their basic structure, search problems offer insights into how fault-tolerant techniques may be applied in various scenarios. In the first part of the book, a paradigmatic model for fault-tolerant search is presented, the Ulam-R?nyi problem. Following a didactic approach, the author takes the reader on a tour of Ulam-R?nyi problem variants of increasing complexity. In the context of this basic model, fundamental combinatorial and algorithmic issues in the design of fault-tolerant search procedures are discussed. The algorithmic efficiency achievable is analyzed with respect to the statistical nature of the error sources, and the amount of information on which the search algorithm bases its decisions. In the second part of the book, more general models of faults and fault-tolerance are considered. Special attention is given to the application of fault-tolerant search procedures to specific problems in distributed computing, bioinformatics and computational learning. This book will be of special value to researchers from the areas of combinatorial search and fault-tolerant computation, but also to researchers in learning andcoding theory, databases, and artificial intelligence. Only basic training in discrete mathematics is assumed. Parts of the book can be used as the basis for specialized graduate courses on combinatorial search, or as supporting material for a graduate or undergraduate course on error-correcting codes. Sprache: Englisch Gewicht in Gramm: 454.…

Título
Fault-Tolerant Search Algorithms Reliable Computation with Unreliable Information
Autor
Ferdinando Cicalese
Editorial
Springer
Año de publicación
2013
Estado
Neu
Encuadernación
Gebundene Ausgabe
Idioma
inglés
ISBN 10
3642173268
ISBN 13
9783642173264
Peso del artículo
454 gramos

Home-set

Mannheim, Alemania

Vendedor de 5 estrellas

Vendedor de IberLibro desde 13 de abril de 2026

Tarifas de envío de Alemania a Estados Unidos de America

ArtículoDe 10 a 12 días hábilesDe 8 a 10 días hábiles
Primer artículoEUR 49,90EUR 75,00
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay
  • Cheque

Especialidad

Buch

Información empresarial del vendedor

Home-set

Alemania