Fault-Tolerant Search Algorithms Reliable Computation with Unreliable Information /
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. O...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2013.
|
Σειρά: | Monographs in Theoretical Computer Science. An EATCS Series,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- Prologue
- Fault-Tolerant Search à la Ulam-Rényi
- Adaptive vs. Nonadaptive Search
- Weighted Errors Over a General Channel
- Variations on a Theme of Ulam and Rényi
- Time-outs
- Broadcast and Learning
- References
- Index.