13214 search results - page 114 / 2643 » Pseudorandomness for network algorithms |
175
click to vote
CIIT
2004
15 years 7 months ago
2004
Ants-based routing algorithms have attracted the attention of researchers because they are more robust, reliable, and scalable than other conventional routing algorithms. Since th...
195
click to vote
CCR
2006
15 years 6 months ago
2006
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
178
click to vote
PEWASUN
2008
ACM
15 years 7 months ago
2008
ACM
In this paper we present an experimental study conducted in 802.11based mesh networks of three existing rate adaptation algorithms. The aim of this study is twofold. On the one ha...
129
click to vote
TON
2008
15 years 6 months ago
2008
The one type of routing in ad hoc and sensor networks that currently appears to be most amenable to algorithmic analysis
203
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...