118 search results - page 18 / 24 » The Shortest Path Problem Under Partial Monitoring |
INFOCOM
2011
IEEE
12 years 12 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— Verifying the accuracy of a passive measurementsbased inference technique under all possible network scenarios is a difficult challenge - the measurement point has lim...
AINA
2004
IEEE
14 years 5 days ago
2004
IEEE
The design of the IP protocol makes it difficult to reliably identify the originator of an IP packet making the defense against Distributed Denial of Service attacks one of the ha...
CPM
1993
Springer
14 years 16 days ago
1993
Springer
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re
ect the correct biolog...
SIGCOMM
1999
ACM
14 years 22 days ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...