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...
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 ...
Patrick Briest, Dimo Brockhoff, Bastian Degener, M...
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...
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,...
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...