410 search results - page 73 / 82 » Upgrading Shortest Paths in Networks |
223
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
STOC
2004
ACM
15 years 12 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Tracking mobile targets using sensor networks is a challenging task because of the impacts of in-the-filed factors such as environment noise, sensing irregularity and etc. This...
PRDC
2007
IEEE
15 years 6 months ago
2007
IEEE
This paper proposes a Highly-Available Open Shortest Path First (HA-OSPF) router which consists of two OSPF router modules-active and standby-to support a highavailability network...
ICPP
2006
IEEE
15 years 5 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...