We Need Diverse Ya Sale
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    The Powell's Playlist | June 15, 2015

    Matthew Quick: IMG Portia Kane's '80s Metal Mix



    Two of Love May Fail's main characters, Portia Kane and Chuck Bass — now in their early 40s — still love the metal music that was... Continue »
    1. $18.19 Sale Hardcover add to wish list

      Love May Fail

      Matthew Quick 9780062285560

    spacer
Qualifying orders ship free.
$46.00
List price: $109.00
Used Hardcover
Ships in 1 to 3 days
Add to Wishlist
Qty Store Section
1 Burnside Mathematics- Computer

Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. an Eatcs Series)

by

Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. an Eatcs Series) Cover

 

Synopses & Reviews

Publisher Comments:

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.

Synopsis:

This book examines approaches to fault-tolerance in the context of algorithmic search theory. It details the application of fault-tolerant search procedures to specific problems in distributed computing, bioinformatics and computational learning.

About the Author

The author received the award for the Best Italian Ph.D. thesis in Theoretical Computer Science, for work in this field, and he has since been awarded the Sofja Kovalevskaja Award of the Alexander von Humboldt Foundation and the German Federal Ministry of Research.

Table of Contents

Prologue.- Fault-Tolerant Search

Product Details

ISBN:
9783642173264
Author:
Cicalese, Ferdinando
Publisher:
Springer
Location:
Berlin, Heidelberg
Subject:
Computer Science
Subject:
Algorithms
Subject:
Coding
Subject:
Combinatorics
Subject:
Fault-tolerant algorithms
Subject:
Information Theory
Subject:
Learning
Subject:
Logic
Subject:
search
Subject:
Theory of computation
Subject:
Algorithms <p>Will be of value to researchers engaged with the theories of search and fault-tolerant computation</p><p>The author puts a special emphasis throughout on algorithmic efficiency</p><p>Is supported throughout with exercises and pointers to bac
Subject:
Mathematics-Applied
Subject:
B
Copyright:
Edition Description:
2011
Series:
Monographs in Theoretical Computer Science. An EATCS Series
Publication Date:
20110729
Binding:
HARDCOVER
Language:
English
Pages:
200
Dimensions:
235 x 155 mm

Related Subjects

Computers and Internet » Computers Reference » General
Computers and Internet » Internet » Web » Search Engines
Computers and Internet » Personal Computers » General
Computers and Internet » Software Engineering » Algorithms
Science and Mathematics » Mathematics » Applied
Science and Mathematics » Mathematics » Computer

Fault-Tolerant Search Algorithms: Reliable Computation with Unreliable Information (Monographs in Theoretical Computer Science. an Eatcs Series) Used Hardcover
0 stars - 0 reviews
$46.00 In Stock
Product details 200 pages Springer - English 9783642173264 Reviews:
"Synopsis" by , This book examines approaches to fault-tolerance in the context of algorithmic search theory. It details the application of fault-tolerant search procedures to specific problems in distributed computing, bioinformatics and computational learning.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.