2084 search results - page 368 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
COCO
2010
Springer
15 years 1 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
WWW
2004
ACM
15 years 10 months ago
2004
ACM
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
ASAP
2007
IEEE
15 years 4 months ago
2007
IEEE
With increasing reliability concerns for current and next generation VLSI technologies, fault-tolerance is fast becoming an integral part of system-on-chip and multicore architect...
LATIN
2004
Springer
15 years 3 months ago
2004
Springer
Time synchronization is necessary in many distributed systems, but achieving synchronization in sensornets, which combine stringent precision requirements with severe resource con...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...