Sciweavers

2473 search results - page 173 / 495
» The Logic of Communication Graphs
Sort
View
153
Voted
OPODIS
2001
15 years 5 months ago
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...
Lélia Blin, Franck Butelle
131
Voted
FUIN
2007
123views more  FUIN 2007»
15 years 3 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
134
Voted
CORR
2010
Springer
179views Education» more  CORR 2010»
15 years 1 months ago
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence ...
Christine A. Kelley, Jörg Kliewer
173
Voted
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 3 months ago
Sensor Networks with Random Links: Topology Design for Distributed Consensus
—In a sensor network, in practice, the communication among sensors is subject to: 1) errors that can cause failures of links among sensors at random times; 2) costs; and 3) const...
Soummya Kar, José M. F. Moura
105
Voted
DAC
2003
ACM
16 years 4 months ago
Optimal integer delay budgeting on directed acyclic graphs
Delay budget is an excess delay each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. W...
Elaheh Bozorgzadeh, Soheil Ghiasi, Atsushi Takahas...