473 search results - page 63 / 95 » Computing shortest paths with uncertainty |
97
Voted
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we p...
IPPS
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
SIAMCOMP
2008
14 years 9 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
CONEXT
2007
ACM
15 years 1 months ago
2007
ACM
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
ICNP
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— We propose to add geographic location information into BGP routing updates to enable Geographically Informed Inter-Domain Routing (GIRO). GIRO departs from previous geo...