Sciweavers

763 search results - page 78 / 153
» Engineering Shortest Path Algorithms
Sort
View
INFOCOM
1998
IEEE
14 years 2 months ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
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...
William T. Zaumen, J. J. Garcia-Luna-Aceves
MOBIHOC
2005
ACM
14 years 9 months ago
Localization and routing in sensor networks by local angle information
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...
Jehoshua Bruck, Jie Gao, Anxiao Jiang
MICCAI
2009
Springer
14 years 11 months ago
Brain Connectivity Using Geodesics in HARDI
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...
Mickaël Péchaud, Maxime Descoteaux, Re...
FOCS
2009
IEEE
14 years 4 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
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...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
DATE
2008
IEEE
138views Hardware» more  DATE 2008»
14 years 4 months ago
BARP-A Dynamic Routing Protocol for Balanced Distribution of Traffic in NoCs
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 ...
Pejman Lotfi-Kamran, Masoud Daneshtalab, Caro Luca...