书目名称 | Fault-Tolerant Search Algorithms |
副标题 | Reliable Computation |
编辑 | Ferdinando Cicalese |
视频video | http://file.papertrans.cn/342/341510/341510.mp4 |
概述 | Will be of value to researchers engaged with the theories of search and fault-tolerant computation.The author puts a special emphasis throughout on algorithmic efficiency.Is supported throughout with |
丛书名称 | Monographs in Theoretical Computer Science. An EATCS Series |
图书封面 |  |
描述 | .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 is |
出版日期 | Book 2013 |
关键词 | Algorithms; Coding; Combinatorics; Fault-tolerant algorithms; Information theory; Learning; Logic; Search |
版次 | 1 |
doi | https://doi.org/10.1007/978-3-642-17327-1 |
isbn_softcover | 978-3-662-51871-7 |
isbn_ebook | 978-3-642-17327-1Series ISSN 1431-2654 Series E-ISSN 2193-2069 |
issn_series | 1431-2654 |
copyright | Springer-Verlag Berlin Heidelberg 2013 |