Sciweavers

866 search results - page 77 / 174
» On Dynamic Shortest Paths Problems
Sort
View
EUROPAR
2007
Springer
15 years 7 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,...
KES
2000
Springer
15 years 5 months ago
Knowledge based genetic algorithm for dynamic route selection
This paper addresses the problem of selecting route to a given destination on a load map under a dynamic environment. The proposed solution is using a genetic algorithm adopting v...
Hitoshi Kanoh, Tomohiro Nakamura
SSD
2007
Springer
132views Database» more  SSD 2007»
15 years 7 months ago
Computing a k -Route over Uncertain Geographical Data
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how lik...
Eliyahu Safra, Yaron Kanza, Nir Dolev, Yehoshua Sa...
SOFSEM
1997
Springer
15 years 5 months ago
Path Layout in ATM Networks
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
Shmuel Zaks
MVA
1998
230views Computer Vision» more  MVA 1998»
15 years 3 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...