找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Distributed Algorithms; 2nd International Wo J. Leeuwen Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 algorithm.algori

[復(fù)制鏈接]
查看: 35314|回復(fù): 68
樓主
發(fā)表于 2025-3-21 16:31:31 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Distributed Algorithms
副標(biāo)題2nd International Wo
編輯J. Leeuwen
視頻videohttp://file.papertrans.cn/282/281713/281713.mp4
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Distributed Algorithms; 2nd International Wo J. Leeuwen Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 algorithm.algori
描述This volume presents the proceedings of the 2nd International Workshop on Distributed Algorithms, held July 8-10, 1987, in Amsterdam, The Netherlands. It contains 29 papers on new developments in the area of the design and analysis of distributed algorithms. The topics covered include, e.g. algorithms for distributed consensus and agreement in networks, connection management and topology update schemes, election and termination detection protocols, and other issues in distributed network control.
出版日期Conference proceedings 1988
關(guān)鍵詞algorithm; algorithms; complexity; database; load balancing; topology; verification; combinatorics; algorith
版次1
doihttps://doi.org/10.1007/BFb0019789
isbn_softcover978-3-540-19366-1
isbn_ebook978-3-540-39239-2Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1988
The information of publication is updating

書目名稱Distributed Algorithms影響因子(影響力)




書目名稱Distributed Algorithms影響因子(影響力)學(xué)科排名




書目名稱Distributed Algorithms網(wǎng)絡(luò)公開度




書目名稱Distributed Algorithms網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Distributed Algorithms被引頻次




書目名稱Distributed Algorithms被引頻次學(xué)科排名




書目名稱Distributed Algorithms年度引用




書目名稱Distributed Algorithms年度引用學(xué)科排名




書目名稱Distributed Algorithms讀者反饋




書目名稱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

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 22:38:20 | 只看該作者
板凳
發(fā)表于 2025-3-22 00:57:18 | 只看該作者
地板
發(fā)表于 2025-3-22 08:08:04 | 只看該作者
5#
發(fā)表于 2025-3-22 11:48:30 | 只看該作者
6#
發(fā)表于 2025-3-22 13:28:19 | 只看該作者
7#
發(fā)表于 2025-3-22 17:52:54 | 只看該作者
A framework for agreement, Generals Problem. The derivation reveals when it is possible to stop early. Using this result, we extend the basic framework into one that yields simple, early-stopping protocols for the Eventual Byzantine Agreement problem. We demonstrate the utility of our results by deriving an early-stopping protocol.
8#
發(fā)表于 2025-3-22 22:23:55 | 只看該作者
Load balancing in a network of transputers,sequential branch-and-bound algorithm in such a way that — together with network management routines — it can be executed in parallel. To show the performance of our strategy a parallel version for the Vertex Cover Problem is implemented. Execution times and speedups obtained with a configuration of 32 transputers are discussed.
9#
發(fā)表于 2025-3-23 04:52:37 | 只看該作者
10#
發(fā)表于 2025-3-23 07:48:43 | 只看該作者
 關(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, 2026-1-18 02:51
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
卢氏县| 定边县| 栾川县| 启东市| 修文县| 顺义区| 温泉县| 朔州市| 镇远县| 佛学| 普兰店市| 湖北省| 繁昌县| 惠水县| 武隆县| 宁乡县| 新乡市| 青阳县| 资阳市| 且末县| 巴南区| 吴川市| 睢宁县| 北辰区| 苍梧县| 扶沟县| 玉山县| 盐城市| 苗栗市| 光泽县| 两当县| 阳信县| 满洲里市| 奇台县| 望奎县| 古浪县| 叙永县| 伊吾县| 徐闻县| 隆子县| 招远市|