Fault-tolerant search algorithms : reliable computation with unreliable information
Resource Information
The work Fault-tolerant search algorithms : reliable computation with unreliable information represents a distinct intellectual or artistic creation found in Sydney Jones Library, University of Liverpool. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Fault-tolerant search algorithms : reliable computation with unreliable information
Resource Information
The work Fault-tolerant search algorithms : reliable computation with unreliable information represents a distinct intellectual or artistic creation found in Sydney Jones Library, University of Liverpool. This resource is a combination of several types including: Work, Language Material, Books.
- Label
- Fault-tolerant search algorithms : reliable computation with unreliable information
- Title remainder
- reliable computation with unreliable information
- Statement of responsibility
- Ferdinando Cicalese
- Language
- eng
- Summary
- 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 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
- Cataloging source
- DKDLA
- Dewey number
-
- 004.2
- 004.0151
- Illustrations
- illustrations
- Index
- no index present
- LC call number
-
- QA76.9.F38
- QA75.5-76.95
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- Series statement
- Monographs in theoretical computer science. An EATCS Series,
Context
Context of Fault-tolerant search algorithms : reliable computation with unreliable informationWork of
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.liverpool.ac.uk/resource/I1Ppg2T4Irc/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/resource/I1Ppg2T4Irc/">Fault-tolerant search algorithms : reliable computation with unreliable information</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">Sydney Jones Library, University of Liverpool</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Work Fault-tolerant search algorithms : reliable computation with unreliable information
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.liverpool.ac.uk/resource/I1Ppg2T4Irc/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/resource/I1Ppg2T4Irc/">Fault-tolerant search algorithms : reliable computation with unreliable information</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">Sydney Jones Library, University of Liverpool</a></span></span></span></span></div>
