LEADER 04057oam 2200505 450 001 9910437591603321 005 20190911112726.0 010 $a3-642-17327-6 024 7 $a10.1007/978-3-642-17327-1 035 $a(OCoLC)864999773 035 $a(MiFhGG)GVRL6YDV 035 $a(EXLCZ)993710000000031256 100 $a20131022d2013 uy 0 101 0 $aeng 135 $aurun|---uuuua 181 $ctxt 182 $cc 183 $acr 200 10$aFault-tolerant search algorithms $ereliable computation with unreliable information /$fFerdinando Cicalese 205 $a1st ed. 2013. 210 1$aHeidelberg [Germany] :$cSpringer,$d2013. 215 $a1 online resource (xv, 207 pages) $cillustrations 225 1 $aMonographs in Theoretical Computer Science. An EATCS Series,$x1431-2654 300 $a"ISSN: 1431-2654." 311 $a3-642-17326-8 320 $aIncludes bibliographical references and index. 327 $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. 330 $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.  . 410 0$aMonographs in theoretical computer science. 606 $aFault-tolerant computing 606 $aComputer science$xMathematics 606 $aInformation theory 606 $aAlgorithms 615 0$aFault-tolerant computing. 615 0$aComputer science$xMathematics. 615 0$aInformation theory. 615 0$aAlgorithms. 676 $a005.741 700 $aCicalese$b Ferdinando$4aut$4http://id.loc.gov/vocabulary/relators/aut$01062317 801 0$bMiFhGG 801 1$bMiFhGG 906 $aBOOK 912 $a9910437591603321 996 $aFault-Tolerant Search Algorithms$92524288 997 $aUNINA