Borrow it
Coverart for item
The Resource Fault-tolerant search algorithms : reliable computation with unreliable information, Ferdinando Cicalese, (electronic book)

Fault-tolerant search algorithms : reliable computation with unreliable information, Ferdinando Cicalese, (electronic book)

Creator
Author
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
Language
eng
Work
Publication
Extent
1 online resource (xv, 207 pages)
Contents
  • Prologue: what this book is about
  • Fault-tolerant search à la Ulam-Rényi
  • Adaptive vs. non-adaptive search
  • Weighted errors over a general channel
  • Variations on a theme of Ulam and Rényi: more types of questions and lies
  • Delays ant time-outs
  • Group testing
  • Resilient search
  • A model for learning
Isbn
9783642173271
Instance
Label
Fault-tolerant search algorithms : reliable computation with unreliable information
Title
Fault-tolerant search algorithms
Title remainder
reliable computation with unreliable information
Statement of responsibility
Ferdinando Cicalese
Creator
Author
Subject
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
Member of
Cataloging source
DKDLA
http://library.link/vocab/creatorName
Cicalese, Ferdinando
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,
http://library.link/vocab/subjectName
  • Fault-tolerant computing
  • Computer science
  • Information theory
  • Algorithms
  • Theory of computation
Label
Fault-tolerant search algorithms : reliable computation with unreliable information, Ferdinando Cicalese, (electronic book)
Instantiates
Publication
Bibliography note
Includes bibliographical references (pages 199-207)
Contents
Prologue: what this book is about -- Fault-tolerant search à la Ulam-Rényi -- Adaptive vs. non-adaptive search -- Weighted errors over a general channel -- Variations on a theme of Ulam and Rényi: more types of questions and lies -- Delays ant time-outs -- Group testing -- Resilient search -- A model for learning
Control code
SPR864999773
Extent
1 online resource (xv, 207 pages)
Form of item
online
Isbn
9783642173271
Other control number
10.1007/978-3-642-17327-1
Other physical details
illustrations.
Reproduction note
Electronic resource.
Specific material designation
remote
Label
Fault-tolerant search algorithms : reliable computation with unreliable information, Ferdinando Cicalese, (electronic book)
Publication
Bibliography note
Includes bibliographical references (pages 199-207)
Contents
Prologue: what this book is about -- Fault-tolerant search à la Ulam-Rényi -- Adaptive vs. non-adaptive search -- Weighted errors over a general channel -- Variations on a theme of Ulam and Rényi: more types of questions and lies -- Delays ant time-outs -- Group testing -- Resilient search -- A model for learning
Control code
SPR864999773
Extent
1 online resource (xv, 207 pages)
Form of item
online
Isbn
9783642173271
Other control number
10.1007/978-3-642-17327-1
Other physical details
illustrations.
Reproduction note
Electronic resource.
Specific material designation
remote

Subject

Member of

Library Locations

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by Sydney Jones Library, University of Liverpool. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...