2924 search results - page 362 / 585 » Lower Bounds in Distributed Computing |
136
click to vote
WORDS
2003
IEEE
15 years 10 months ago
2003
IEEE
Most of today’s distributed computing systems in the field do not support the migration of execution entities among computing nodes during runtime. The relatively static associa...
170
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
156
Voted
ETT
2002
15 years 4 months ago
2002
In computer networks, the Strict Priority (SP) discipline is perhaps the most common and simplest method to schedule packets from different classes of applications, each with diver...
150
click to vote
TASLP
2010
14 years 11 months ago
2010
This paper presents a framework for efficient HMM-based estimation of unreliable spectrographic speech data. It discusses the role of Hidden Markov Models (HMMs) during minimum mea...
147
click to vote
CONCUR
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...