2473 search results - page 50 / 495 » The Logic of Communication Graphs |
NGC
2000
Springer
13 years 7 months ago
2000
Springer
In this paper we introduce the logic programminglanguage Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive C...
ENTCS
2006
13 years 7 months ago
2006
Graph traversals are in the basis of many distributed algorithms. In this paper, we use graph relabelling systems to encode two basic graph traversals which are the broadcast and ...
ISAAC
1998
Springer
13 years 12 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
CJ
1999
13 years 7 months ago
1999
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...