763 search results - page 78 / 153 » Engineering Shortest Path Algorithms |
123
click to vote
INFOCOM
1998
IEEE
15 years 6 months ago
1998
IEEE
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
126
Voted
MOBIHOC
2005
ACM
16 years 1 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...
104
Voted
MICCAI
2009
Springer
16 years 3 months ago
2009
Springer
We develop an algorithm for brain connectivity assessment using geodesics in HARDI (high angular resolution diusion imaging). We propose to recast the problem of nding bers bundles...
94
Voted
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
138
Voted
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
A novel routing algorithm, named Balanced Adaptive Routing Protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at ...