2996 search results - page 409 / 600 » Numberings and Randomness |
195
click to vote
INFOCOM
2005
IEEE
16 years 6 days ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
197
click to vote
STACS
2005
Springer
16 years 3 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
162
click to vote
MOBICOM
2004
ACM
16 years 1 days ago
2004
ACM
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
168
click to vote
MSWIM
2004
ACM
16 years 1 days ago
2004
ACM
Most comparisons of wireless ad hoc routing algorithms involve simulated or indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorre...
152
click to vote
SIGMETRICS
2004
ACM
16 years 1 days ago
2004
ACM
In this paper, we consider a set of HTTP flows using TCP over a common drop-tail link to download files. After each download, a flow waits for a random think time before reques...