353 search results - page 50 / 71 » Two-phase Algorithms for the Parametric Shortest Path Proble... |
NETWORKS
2006
13 years 8 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
PPSN
2004
Springer
14 years 2 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
MOBIHOC
2005
ACM
14 years 8 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...
EUROPAR
2007
Springer
14 years 2 months ago
2007
Springer
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...
MICCAI
2009
Springer
14 years 10 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...