1594 search results - page 79 / 319 » An Algorithm to Compute Collusion Paths |
119
click to vote
ISCC
2005
IEEE
15 years 8 months ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
117
click to vote
ICNP
2003
IEEE
15 years 8 months ago
2003
IEEE
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as ¢¤£¦¥¨§© , which is prohibitive i...
105
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
In off-line streaming, packet level erasure resilient Forward Error Correction (FEC) codes rely on the unrestricted buffering time at the receiver. In real-time streaming, the ext...
103
click to vote
ICPPW
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
155
click to vote
ICRA
2000
IEEE
15 years 6 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...