000 04312nam a22004935i 4500
001 vtls000484267
003 RU-ToGU
005 20210922065518.0
007 cr nn 008mamaa
008 140715s2013 gw | s |||| 0|eng d
020 _a9783642173271
_9978-3-642-17327-1
024 7 _a10.1007/978-3-642-17327-1
_2doi
035 _ato000484267
040 _aSpringer
_cSpringer
_dRU-ToGU
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
100 1 _aCicalese, Ferdinando.
_eauthor.
_9412984
245 1 0 _aFault-Tolerant Search Algorithms
_h[electronic resource] :
_bReliable Computation with Unreliable Information /
_cby Ferdinando Cicalese.
260 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _aXV, 207 p. 14 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
490 1 _aMonographs in Theoretical Computer Science. An EATCS Series,
_x1431-2654
505 0 _aPrologue -- 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.
520 _aWhy 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.  
650 0 _aComputer Science.
_9155490
650 0 _aInformation theory.
_9303504
650 0 _aAlgorithms.
_9304813
650 1 4 _aComputer Science.
_9155490
650 2 4 _aTheory of Computation.
_9303507
650 2 4 _aAlgorithms.
_9304813
710 2 _aSpringerLink (Online service)
_9143950
773 0 _tSpringer eBooks
830 0 _aMonographs in Theoretical Computer Science. An EATCS Series,
_9323526
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-17327-1
912 _aZDB-2-SCS
999 _c355884