10 search results - page 2 / 2 » The on-line shortest path problem under partial monitoring |
ICCTA
2007
IEEE
13 years 11 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
JDA
2006
13 years 5 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
GLOBECOM
2009
IEEE
13 years 3 months ago
2009
IEEE
Abstract--We consider a set of multicast sources, each multicasting a finite amount of data to its corresponding destinations. The objective is to minimize the time to deliver all ...
ICNP
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract— We propose the first practical solution to the longstanding problem of secure wireless routing in the presence of colluding attackers. Our secure routing protocol, Spr...
BMCBI
2010
13 years 5 months ago
2010
Background: The construction of interaction networks between proteins is central to understanding the underlying biological processes. However, since many useful relations are exc...