Sciweavers

763 search results - page 110 / 153
» Engineering Shortest Path Algorithms
Sort
View
ICDCS
2010
IEEE
14 years 1 months ago
CONTRACT: Incorporating Coordination into the IP Network Control Plane
—This paper presents the CONTRACT framework to address a fundamental deficiency of the IP network control plane, namely the lack of coordination between an IGP and other control...
Zheng Cai, Florin Dinu, Jie Zheng, Alan L. Cox, T....
COMCOM
2006
80views more  COMCOM 2006»
13 years 9 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...
IJSNET
2006
170views more  IJSNET 2006»
13 years 9 months ago
Ordinal MDS-based localisation for wireless sensor networks
: There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Over the past few years, there have been dif...
Vijayanth Vivekanandan, Vincent W. S. Wong
JEA
2006
83views more  JEA 2006»
13 years 9 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna
PVLDB
2010
152views more  PVLDB 2010»
13 years 8 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...