13214 search results - page 395 / 2643 » Pseudorandomness for network algorithms |
182
click to vote
WABI
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Computational inference of transcriptional regulatory networks remains a challenging problem, in part due to the lack of strong network models. In this paper we present e...
182
click to vote
CEC
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract-- Resource discovery is an essential problem in peerto-peer networks since there is no centralized index in which to look for information about resources. In a pure P2P ne...
154
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
172
click to vote
IWCMC
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of scheduling emergency responders to geospatially located finite duration temporally bounded tasks. We consider two different schedulers, Greedy and Mee...
177
Voted
ESA
2003
Springer
16 years 2 days ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...