2924 search results - page 388 / 585 » Lower Bounds in Distributed Computing |
121
click to vote
EUROPAR
2010
Springer
15 years 6 months ago
2010
Springer
The bag-of-tasks application model, albeit simple, arises in many application domains and has received a lot of attention in the scheduling literature. Previous works propose eithe...
129
click to vote
ICPPW
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper concerns the design and verification of a realtime communication protocol for sensor data collection and processing between an embedded computer and a DSP. In such sys...
154
Voted
CONCUR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
147
Voted
CLUSTER
2004
IEEE
15 years 4 months ago
2004
IEEE
The efficient use of network capacity in shared restoration schemes strongly depends upon the path selection procedure. In this paper we propose and evaluate path selection algorit...
140
click to vote
CONCUR
2000
Springer
15 years 8 months ago
2000
Springer
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...