Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. An EATCS Series) Book PDF, ePub eBook

Join our eBook service for unlimited books & audiobooks. Get a free 7 day subscription! ↓↓↓↓↓


Book Descriptions:

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.

 

Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. An EATCS Series) by Ferdinando Cicalese

From reader reviews:

Susan Velez:

Spent a free a chance to be fun activity to complete! A lot of people spent their sparetime with their family, or all their friends. Usually they doing activity like watching television, likely to beach, or picnic from the park. They actually doing ditto every week. Do you feel it? Do you need to something different to fill your own free time/ holiday? Might be reading a book may be option to fill your free of charge time/ holiday. The first thing that you will ask may be what kinds of book that you should read. If you want to consider look for book, may be the publication untitled Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. An EATCS Series) can be great book to read. May be it is usually best activity to you.

Elaine Moore:

The book untitled Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. An EATCS Series) contain a lot of information on it. The writer explains the girl idea with easy method. The language is very straightforward all the people, so do not really worry, you can easy to read it. The book was written by famous author. The author provides you in the new period of literary works. You can read this book because you can continue reading your smart phone, or gadget, so you can read the book throughout anywhere and anytime. In a situation you wish to purchase the e-book, you can wide open their official web-site along with order it. Have a nice study.

Jack Michaud:

In this era globalization it is important to someone to find information. The information will make anyone to understand the condition of the world. The fitness of the world makes the information much easier to share. You can find a lot of references to get information example: internet, magazine, book, and soon. You will see that now, a lot of publisher in which print many kinds of book. The book that recommended to you personally is Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. An EATCS Series) this reserve consist a lot of the information from the condition of this world now. This kind of book was represented so why is the world has grown up. The words styles that writer value to explain it is easy to understand. Often the writer made some analysis when he makes this book. That's why this book suitable all of you.

Walter Burchett:

Don't be worry for anyone who is afraid that this book can filled the space in your house, you can have it in e-book way, more simple and reachable. That Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. An EATCS Series) can give you a lot of close friends because by you taking a look at this one book you have factor that they don't and make you more like an interesting person. This specific book can be one of one step for you to get success. This guide offer you information that maybe your friend doesn't realize, by knowing more than different make you to be great people. So , why hesitate? Let us have Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. An EATCS Series).