浮标 发表于 2025-3-21 16:31:31

书目名称Distributed Algorithms影响因子(影响力)<br>        http://figure.impactfactor.cn/if/?ISSN=BK0281713<br><br>        <br><br>书目名称Distributed Algorithms影响因子(影响力)学科排名<br>        http://figure.impactfactor.cn/ifr/?ISSN=BK0281713<br><br>        <br><br>书目名称Distributed Algorithms网络公开度<br>        http://figure.impactfactor.cn/at/?ISSN=BK0281713<br><br>        <br><br>书目名称Distributed Algorithms网络公开度学科排名<br>        http://figure.impactfactor.cn/atr/?ISSN=BK0281713<br><br>        <br><br>书目名称Distributed Algorithms被引频次<br>        http://figure.impactfactor.cn/tc/?ISSN=BK0281713<br><br>        <br><br>书目名称Distributed Algorithms被引频次学科排名<br>        http://figure.impactfactor.cn/tcr/?ISSN=BK0281713<br><br>        <br><br>书目名称Distributed Algorithms年度引用<br>        http://figure.impactfactor.cn/ii/?ISSN=BK0281713<br><br>        <br><br>书目名称Distributed Algorithms年度引用学科排名<br>        http://figure.impactfactor.cn/iir/?ISSN=BK0281713<br><br>        <br><br>书目名称Distributed Algorithms读者反馈<br>        http://figure.impactfactor.cn/5y/?ISSN=BK0281713<br><br>        <br><br>书目名称Distributed Algorithms读者反馈学科排名<br>        http://figure.impactfactor.cn/5yr/?ISSN=BK0281713<br><br>        <br><br>

Incompetent 发表于 2025-3-21 22:38:20

http://reply.papertrans.cn/29/2818/281713/281713_2.png

Criteria 发表于 2025-3-22 00:57:18

http://reply.papertrans.cn/29/2818/281713/281713_3.png

Commentary 发表于 2025-3-22 08:08:04

http://reply.papertrans.cn/29/2818/281713/281713_4.png

伪善 发表于 2025-3-22 11:48:30

http://reply.papertrans.cn/29/2818/281713/281713_5.png

Bone-Scan 发表于 2025-3-22 13:28:19

http://reply.papertrans.cn/29/2818/281713/281713_6.png

Bone-Scan 发表于 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.

PACK 发表于 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.

extinguish 发表于 2025-3-23 04:52:37

http://reply.papertrans.cn/29/2818/281713/281713_9.png

过份艳丽 发表于 2025-3-23 07:48:43

http://reply.papertrans.cn/29/2818/281713/281713_10.png
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: Distributed Algorithms; 2nd International Wo J. Leeuwen Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 algorithm.algori