找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Fault-Tolerant Search Algorithms; Reliable Computation Ferdinando Cicalese Book 2013 Springer-Verlag Berlin Heidelberg 2013 Algorithms.Codi

[复制链接]
查看: 15202|回复: 39
发表于 2025-3-21 18:55:32 | 显示全部楼层 |阅读模式
书目名称Fault-Tolerant Search Algorithms
副标题Reliable Computation
编辑Ferdinando Cicalese
视频videohttp://file.papertrans.cn/342/341510/341510.mp4
概述Will be of value to researchers engaged with the theories of search and fault-tolerant computation.The author puts a special emphasis throughout on algorithmic efficiency.Is supported throughout with
丛书名称Monographs in Theoretical Computer Science. An EATCS Series
图书封面Titlebook: Fault-Tolerant Search Algorithms; Reliable Computation Ferdinando Cicalese Book 2013 Springer-Verlag Berlin Heidelberg 2013 Algorithms.Codi
描述.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 is
出版日期Book 2013
关键词Algorithms; Coding; Combinatorics; Fault-tolerant algorithms; Information theory; Learning; Logic; Search
版次1
doihttps://doi.org/10.1007/978-3-642-17327-1
isbn_softcover978-3-662-51871-7
isbn_ebook978-3-642-17327-1Series ISSN 1431-2654 Series E-ISSN 2193-2069
issn_series 1431-2654
copyrightSpringer-Verlag Berlin Heidelberg 2013
The information of publication is updating

书目名称Fault-Tolerant Search Algorithms影响因子(影响力)




书目名称Fault-Tolerant Search Algorithms影响因子(影响力)学科排名




书目名称Fault-Tolerant Search Algorithms网络公开度




书目名称Fault-Tolerant Search Algorithms网络公开度学科排名




书目名称Fault-Tolerant Search Algorithms被引频次




书目名称Fault-Tolerant Search Algorithms被引频次学科排名




书目名称Fault-Tolerant Search Algorithms年度引用




书目名称Fault-Tolerant Search Algorithms年度引用学科排名




书目名称Fault-Tolerant Search Algorithms读者反馈




书目名称Fault-Tolerant Search Algorithms读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:03:09 | 显示全部楼层
第141510主题贴--第2楼 (沙发)
发表于 2025-3-22 02:17:27 | 显示全部楼层
板凳
发表于 2025-3-22 04:57:48 | 显示全部楼层
第4楼
发表于 2025-3-22 08:44:43 | 显示全部楼层
5楼
发表于 2025-3-22 13:03:31 | 显示全部楼层
6楼
发表于 2025-3-22 18:56:42 | 显示全部楼层
7楼
发表于 2025-3-23 00:22:07 | 显示全部楼层
8楼
发表于 2025-3-23 03:11:25 | 显示全部楼层
9楼
发表于 2025-3-23 07:21:18 | 显示全部楼层
10楼
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-9-11 10:38
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表