625 search results - page 96 / 125 » Approximating Travel Times Using Opportunistic Networking |
109
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
102
click to vote
MSWIM
2006
ACM
15 years 7 months ago
2006
ACM
Third generation wireless systems can simultaneously accommodate flow transmissions of users with widely heterogeneous applications. As resources are limited (particularly in the...
120
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
119
click to vote
CORR
2010
Springer
15 years 2 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 ...
105
click to vote
CCR
2010
15 years 2 months ago
2010
TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion wind...