Fault-Tolerant Search Algorithms, 1st Edition

  • Published By:
  • ISBN-10: 3642173276
  • ISBN-13: 9783642173271
  • DDC: 004.2
  • Grade Level Range: College Freshman - College Senior
  • 207 Pages | eBook
  • Original Copyright 2013 | Published/Released June 2014
  • This publication's content originally published in print form: 2013

  • Price:  Sign in for price



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.

Table of Contents

Front Cover.
Other Frontmatter.
Title Page.
Copyright Page.
1: Prologue: What This Book Is About.
2: The Ulam-Rényi Game and Its Variants.
3: Fault-Tolerant Search à la Ulam-Rényi.
4: Adaptive vs. Non-Adaptive Search.
5: Weighted Errors over a General Channel.
6: Variations on a Theme of Ulam and Rényi: More Types of Questions and Lies.
7: Other Models.
8: Delays and Time Outs.
9: Group Testing.
10: Resilient Search.
11: A Model for Learning.