Sciweavers

467 search results - page 57 / 94
» Acceleration of Shortest Path and Constrained Shortest Path ...
Sort
View
MST
2002
152views more  MST 2002»
13 years 7 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
MICCAI
2009
Springer
14 years 8 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...
ACID
2006
298views Algorithms» more  ACID 2006»
13 years 8 months ago
Congestion Games: Optimization in Competition
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
Berthold Vöcking
EUROPAR
2007
Springer
14 years 1 months ago
New Approaches for Relay Selection in IEEE 802.16 Mobile Multi-hop Relay Networks
The IEEE 802.16 mobile multi-hop relay (MMR) task group ’j’ (TGj) has recently introduced the multi-hop relaying concept in the IEEE 802.16 WirelessMAN, wherein a newly introdu...
Deepesh Man Shrestha, Sung-Hee Lee, Sung-Chan Kim,...
SIMUTOOLS
2008
13 years 8 months ago
An OMNeT++ model for the evaluation of OBS routing strategies
Optical Burst Switching (OBS) has been proposed as a costeffective paradigm for supporting, with adequate flexibility, the increasingly high transmission capacity required by the ...
A. L. Barradas, M. C. R. Medeiros