找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Stabilization, Safety, and Security of Distributed Systems; 19th International S Paul Spirakis,Philippas Tsigas Conference proceedings 2017

[复制链接]
楼主: minuscule
发表于 2025-3-30 12:07:18 | 显示全部楼层
On Security Analysis of Proof-of-Elapsed-Time (PoET),struction. Recently Intel proposed a new concept of proof-of-elapsed-time (PoET), which leverages trusted computing to enforce random waiting times for block construction. However, trusted computing component may not be perfect and 100% reliable. It is not clear, to what extent, blockchain systems b
发表于 2025-3-30 14:34:32 | 显示全部楼层
发表于 2025-3-30 16:58:51 | 显示全部楼层
发表于 2025-3-30 20:52:57 | 显示全部楼层
Self-stabilizing Localization of the Middle Point of a Line Segment by an Oblivious Robot with Liminot, and unsettled yet. This paper is concerned with three variants of the original problem, minimally relaxing, and presents self-stabilizing algorithms for them. We also show an easy impossibility theorem for bilaterally symmetric algorithms.
发表于 2025-3-31 03:38:07 | 显示全部楼层
Generalized Paxos Made Byzantine (and Less Complex),l. In this paper, we make two main contributions. First, we provide a description of Generalized Paxos that is easier to understand, based on a simpler specification and the pseudocode for a solution that can be readily implemented. Second, we extend the protocol to the Byzantine fault model.
发表于 2025-3-31 07:52:21 | 显示全部楼层
发表于 2025-3-31 12:58:58 | 显示全部楼层
,Constant-Time Complete Visibility for Asynchronous Robots with Lights,ime, . color algorithm for this problem in the asynchronous setting. The proposed algorithm is . – robots do not share positions and their paths do not cross. We also introduce a technique, called Beacon-Directed Curve Positioning, for moving robots in an asynchronous setting, that may be of independent interest.
发表于 2025-3-31 15:03:13 | 显示全部楼层
发表于 2025-3-31 19:56:45 | 显示全部楼层
An Improved Approximate Consensus Algorithm in the Presence of Mobile Faults,ault-tolerance level. In particular, we present an approximate consensus algorithm that requires only . nodes, an . improvement over the state-of-the-art algorithms. Moreover, we also show that the proposed algorithm is . within a family of ..
发表于 2025-3-31 22:53:13 | 显示全部楼层
Fault-Induced Dynamics of Oblivious Robots on a Line,on a line, and at most two of them are faulty. Interestingly, and perhaps surprisingly, the presence of faults induces the robots to perform some form of ., rather than .. In fact, we discover that they arrange themselves inside the segment delimited by the two faults in interleaved sequences of equidistant robots.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-21 02:10
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表