Sciweavers

112 search results - page 8 / 23
» Message passing without send-receive
Sort
View
JCP
2006
100views more  JCP 2006»
13 years 9 months ago
A Local Enumeration Protocol in Spite of Corrupted Data
We present a novel self-stabilizing version of Mazurkiewicz enumeration algorithm [1]. The initial version is based on local rules to enumerate nodes on an anonymous network. [2] p...
Brahim Hamid, Mohamed Mosbah
IFIP
1998
Springer
14 years 2 months ago
On the architecture of software component systems
Current object-oriented development practice is centered around application frameworks. In this paper, we argue that this approach is misleading, as it distracts from the ultimate...
M. Franz
CUZA
2002
84views more  CUZA 2002»
13 years 9 months ago
Testing Theories for Broadcasting Processes
This paper presents a theory of testing for processes calculi which have broadcast as basic communication primitive. Firstly, we justify the necessity of an alternative theory to b...
Cristian Ene, Traian Muntean
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 4 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
ICASSP
2011
IEEE
13 years 1 months ago
Optimal wireless networks based on local channel state information
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
Yichuan Hu, Alejandro Ribeiro