Sciweavers

474 search results - page 6 / 95
» On Multicast Path Finding Algorithms
Sort
View
W2GIS
2004
Springer
14 years 29 days ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
JPDC
2008
128views more  JPDC 2008»
13 years 7 months ago
An interference-aware fair scheduling for multicast in wireless mesh networks
Multicast is a fundamental routing service in wireless mesh networks (WMNs) due to its many potential applications such as video conferencing, online games, and webcast. Recently,...
Dimitrios Koutsonikolas, Saumitra M. Das, Y. Charl...
ISCIS
2004
Springer
14 years 1 months ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak...
ICRA
2007
IEEE
134views Robotics» more  ICRA 2007»
14 years 1 months ago
MRBUG: A Competitive Multi-Robot Path Finding Algorithm
— We explore an on-line problem where a group of robots has to reach a target whose position is known in an unknown planar environment whose geometry is acquired by the robots du...
Shahar Sarid, Amir Shapiro, Yoav Gabriely
SOFSEM
2010
Springer
14 years 4 months ago
A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks
Maxim A. Babenko, Ignat I. Kolesnichenko, Ilya P. ...