473 search results - page 56 / 95 » Computing shortest paths with uncertainty |
MST
2002
14 years 9 months ago
2002
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...
AINA
2008
IEEE
15 years 4 months ago
2008
IEEE
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destinat...
EUROPAR
2007
Springer
15 years 3 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...
74
Voted
SIMUTOOLS
2008
14 years 11 months ago
2008
Optical Burst Switching (OBS) has been proposed as a costeffective paradigm for supporting, with adequate flexibility, the increasingly high transmission capacity required by the ...
AROBOTS
2007
14 years 9 months ago
2007
The process of protein crystallization is explained using the theory of robotics, particularly path planning of mobile robots. Path planning is a procedure which specifies motion ...