找回密碼
 To register

QQ登錄

只需一步，快速開(kāi)始

掃一掃，訪(fǎng)問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Distributed Algorithms; 6th International Wo Adrian Segall,Shmuel Zaks Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 A

[復(fù)制鏈接]
查看: 44663|回復(fù): 60
樓主
發(fā)表于 2025-3-21 17:02:46 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱(chēng)Distributed Algorithms
副標(biāo)題6th International Wo
編輯Adrian Segall,Shmuel Zaks
視頻videohttp://file.papertrans.cn/282/281711/281711.mp4
叢書(shū)名稱(chēng)Lecture Notes in Computer Science
圖書(shū)封面Titlebook: Distributed Algorithms; 6th International Wo Adrian Segall,Shmuel Zaks Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 A
描述This volume presents the proceedings of the Sixth Workshopon Distributed Algorithms (WDAG 92), held in Haifa, Israel,November 2-4, 1992. WDAG provides a forum for researchersand other parties interested in distributedalgorithms andtheir applications. The aim is to present recent researchresults, explore directions for future research, andidentifycommon fundamental techniques that serve asbuilding blocks in many distributed algorithms.Papers in the volume describe original results in all areasof distributed algorithms and their applications, includingdistributed graph algorithms, distributed combinatorialalgorithms, design of network protocols, routing andflowcontrol, communication complexity, fault-tolerantdistributedalgorithms, distributed data structures,distributed database techniques, replica control protocols,distributed optimization algorithms, mechanismsfor safetyand security in distributed systems, and protocols forreal-time distributed systems.
出版日期Conference proceedings 1992
關(guān)鍵詞Algorithms; Routing; algorithm; complexity; data structure; distributed systems; optimization; real-time; se
版次1
doihttps://doi.org/10.1007/3-540-56188-9
isbn_softcover978-3-540-56188-0
isbn_ebook978-3-540-47484-5Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1992
The information of publication is updating

書(shū)目名稱(chēng)Distributed Algorithms影響因子(影響力)




書(shū)目名稱(chēng)Distributed Algorithms影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Distributed Algorithms網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Distributed Algorithms網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Distributed Algorithms被引頻次




書(shū)目名稱(chēng)Distributed Algorithms被引頻次學(xué)科排名




書(shū)目名稱(chēng)Distributed Algorithms年度引用




書(shū)目名稱(chēng)Distributed Algorithms年度引用學(xué)科排名




書(shū)目名稱(chēng)Distributed Algorithms讀者反饋




書(shū)目名稱(chēng)Distributed Algorithms讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics
 

0票 0%

Better Implies Difficulty
 

0票 0%

Good and Satisfactory
 

0票 0%

Adverse Performance
 

0票 0%

Disdainful Garbage
您所在的用戶(hù)組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:11:24 | 只看該作者
板凳
發(fā)表于 2025-3-22 04:04:40 | 只看該作者
地板
發(fā)表于 2025-3-22 05:39:10 | 只看該作者
https://doi.org/10.1007/978-1-349-03555-7istributed algorithm whose message complexity is . and produces a new distributed algorithm for the same problem with .·. log . log .) message complexity, where . and . are the total number of nodes and links in the network, and . is an arbitrary function of . and ...Applying our paradigm to the sta
5#
發(fā)表于 2025-3-22 10:03:01 | 只看該作者
6#
發(fā)表于 2025-3-22 16:13:12 | 只看該作者
https://doi.org/10.1007/978-1-349-03555-7It is shown that any algorithm for solving lattice agreement can be used to implement the snapshot object. Several new lattice agreement algorithms are presented. The most efficient is a lattice agreement algorithm (and hence, an implementation of snapshot objects) using .(log..) operations on 2-pro
7#
發(fā)表于 2025-3-22 18:40:54 | 只看該作者
https://doi.org/10.1007/978-1-349-03555-7asynchronous processes which causes all correct processes to agree on one out of . possible alternatives. The agreement on a single choice is complicated by the fact that there is no . agreement on names for the alternatives. Furthermore processes must state their choice and do all communication via
8#
發(fā)表于 2025-3-22 21:25:28 | 只看該作者
9#
發(fā)表于 2025-3-23 03:31:50 | 只看該作者
https://doi.org/10.1007/978-1-349-03555-7tem objects are labeled by a process called .. Using these labels a . process can return a set of labeled objects ordered temporally. In this paper we present a time-stamp system with . time and space complexity. To achieve this complexity we introduce two way communication between labelers and scan
10#
發(fā)表于 2025-3-23 08:26:37 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-8 13:08
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
灌云县| 惠州市| 万源市| 瑞安市| 大余县| 河池市| 五华县| 明星| 双桥区| 富裕县| 大埔县| 湘乡市| 景泰县| 永新县| 阜新市| 桃江县| 津市市| 简阳市| 奎屯市| 申扎县| 万载县| 营口市| 阜康市| 红安县| 乌审旗| 佛教| 南投市| 花垣县| 建阳市| 新民市| 合水县| 太康县| 新竹市| 桐梓县| 长乐市| 临沧市| 高邮市| 红原县| 安塞县| 靖江市| 邵武市|