• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information

Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information

Hardcover

Series: Monographs in Theoretical Computer Science. an Eatcs

General ComputersGeneral MathematicsProgramming

ISBN10: 3642173268
ISBN13: 9783642173264
Publisher: Springer
Published: Dec 16 2013
Pages: 207
Weight: 1.08
Height: 0.56 Width: 6.14 Depth: 9.21
Language: English

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.

Also in

General Mathematics