Go back
Fault Tolerant Search Algorithms Reliable Computation With Unreliable Information(1st Edition)
Authors:
Ferdinando Cicalese
Cover Type:Hardcover
Condition:Used
In Stock
Shipment time
Expected shipping within 2 DaysPopular items with books
Access to 30 Million+ solutions
Free ✝
Ask 50 Questions from expert
AI-Powered Answers
✝ 7 days-trial
Total Price:
$0
List Price: $54.99
Savings: $54.99(100%)
Solution Manual Includes
Access to 30 Million+ solutions
Ask 50 Questions from expert
AI-Powered Answers
24/7 Tutor Help
Detailed solutions for Fault Tolerant Search Algorithms Reliable Computation With Unreliable Information
Price:
$9.99
/month
Book details
ISBN: 3662518716, 978-3662518717
Book publisher: Springer
Get your hands on the best-selling book Fault Tolerant Search Algorithms Reliable Computation With Unreliable Information 1st Edition for free. Feed your curiosity and let your imagination soar with the best stories coming out to you without hefty price tags. Browse SolutionInn to discover a treasure trove of fiction and non-fiction books where every page leads the reader to an undiscovered world. Start your literary adventure right away and also enjoy free shipping of these complimentary books to your door.
Book Summary: 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 and coding 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.
Customers also bought these books
Frequently Bought Together
Top Reviews for Books
Request rx062d6
( 5 )
"Delivery was considerably fast, and the book I received was in a good condition."