625 search results - page 61 / 125 » Approximating Travel Times Using Opportunistic Networking |
129
click to vote
SRDS
1999
IEEE
15 years 7 months ago
1999
IEEE
Numerous mathematical approaches have been proposed to determine the optimal checkpoint interval for minimizing total execution time of an application in the presence of failures....
131
Voted
NN
1997
Springer
15 years 7 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
145
Voted
DSN
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we present a variational Bayesian (VB) approach to computing the interval estimates for nonhomogeneous Poisson process (NHPP) software reliability models. This appr...
140
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Robotic swarms, like all spatial computers, are a challenging environment for the execution of distributed consensus algorithms due to their scale, diameter, and frequent failures...
132
click to vote
SIGCOMM
2000
ACM
15 years 7 months ago
2000
ACM
We describe a deterministic model of packet delay and use it to derive both the packet pair [2] property of FIFO-queueing networks and a new technique (packet tailgating) for acti...