2084 search results - page 193 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
118
Voted
TPDS
1998
15 years 2 months ago
1998
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...
118
Voted
SASO
2007
IEEE
15 years 8 months ago
2007
IEEE
The study of synchronization has received much attention in a variety of applications, ranging from coordinating sensors in wireless networks to models of fireflies flashing in...
117
Voted
FM
2001
Springer
15 years 7 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
106
Voted
WEA
2005
Springer
15 years 8 months ago
2005
Springer
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
108
Voted
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...