625 search results - page 110 / 125 » Approximating Travel Times Using Opportunistic Networking |
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
105
click to vote
HICSS
2007
IEEE
15 years 3 months ago
2007
IEEE
We introduce a stochastic model that describes the quasistatic dynamics of an electric transmission network under perturbations introduced by random load fluctuations, random rem...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents an extensive statistical study and analysis of the effects of channel delays in the current (best-effort) Internet on underflow events in MPEG-4 video streamin...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
WSC
1997
14 years 10 months ago
1997
We present a system for describing and solving closed queuing network models of the memory access performance of NUMA architectures. The system consists of a model description lan...