找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Distributed Algorithms; 4th International Wo Jan Leeuwen,Nicola Santoro Conference proceedings 1991 Springer-Verlag Berlin Heidelberg 1991

[復(fù)制鏈接]
樓主: clot-buster
41#
發(fā)表于 2025-3-28 17:20:10 | 只看該作者
42#
發(fā)表于 2025-3-28 20:49:12 | 只看該作者
Localized-access protocols for replicated databases,us avoiding communication overhead and distributed commitment, which are required by most other replica control protocols. In the first protocol, data accessibility at a site can be dynamically reconfigured using special transactions, which are executed on demand. In the second protocol, data access
43#
發(fā)表于 2025-3-29 02:25:14 | 只看該作者
44#
發(fā)表于 2025-3-29 04:45:46 | 只看該作者
45#
發(fā)表于 2025-3-29 07:27:07 | 只看該作者
0302-9743 90. The workshop was a forum for researchers, students and other interested persons to discuss recent results and trends in the design and analysis of distributed algorithms for communication networks and decentralized systems. The volume includes all 28 papers presented at the workshop, covering cu
46#
發(fā)表于 2025-3-29 14:14:55 | 只看該作者
P. Poitras,J. Bissonnette,Alan Barkun a complete traversal of the network. The complexities in time and in number of messages of this algorithm are linear with respect to the size of the network (number of communication lines), which improves the exponential solution already known in the Byzantine case with some special assumptions.
47#
發(fā)表于 2025-3-29 19:25:45 | 只看該作者
Charles Travis,Alexander von LünenFirst an abstract algorithm is presented and its safety and liveness properties are proved. Then a concrete, distributed algorithm is shown to correctly implement the abstract one. Experimental results of the transputer implementation are also reported.
48#
發(fā)表于 2025-3-29 20:06:44 | 只看該作者
Steven Van Uytsel,Yoshiteru Uemurar the cases of one or two operations. We introduce a technique for reducing the number of operations considered in the analysis. Using this technique we extend the above results to all cases of three operations.
49#
發(fā)表于 2025-3-30 02:39:29 | 只看該作者
P. Poitras,L. Tremblay,K. Orlicka properties; (ii) a single-source algorithm for outerplane graphs; and (iii) identifying any edge in an outerplane graph whose cost exceeds the distance between its endpoints. As an application, an efficient message routing scheme is presented which adapts to changing link conditions and routes along near-shortest paths.
50#
發(fā)表于 2025-3-30 05:52:05 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 22:42
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
璧山县| 江山市| 镇巴县| 兰州市| 肥西县| 庆城县| 德阳市| 阳泉市| 余干县| 小金县| 汶川县| 临澧县| 宜城市| 金门县| 开封市| 呼伦贝尔市| 阳山县| 于田县| 紫云| 临武县| 姜堰市| 建阳市| 堆龙德庆县| 萨嘎县| 寻乌县| 龙胜| 木里| 怀宁县| 潞西市| 乌拉特中旗| 隆林| 沁源县| 鞍山市| 长寿区| 塔城市| 若羌县| 韩城市| 辰溪县| 保山市| 新竹市| 台安县|