Sciweavers

866 search results - page 74 / 174
» On Dynamic Shortest Paths Problems
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
On Channel-Discontinuity-Constraint Routing in Wireless Networks
Multi-channel wireless networks are increasingly being employed as infrastructure networks, e.g. in metro areas. Nodes in these networks frequently employ directional antennas to ...
Swaminathan Sankararaman, Alon Efrat, Srinivasan R...
TIP
1998
114views more  TIP 1998»
13 years 7 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
13 years 12 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
IFM
2009
Springer
124views Formal Methods» more  IFM 2009»
14 years 2 months ago
Dynamic Path Reduction for Software Model Checking
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
Zijiang Yang, Bashar Al-Rawi, Karem Sakallah, Xiao...
ICRA
2007
IEEE
154views Robotics» more  ICRA 2007»
14 years 2 months ago
Path Planning for Planetary Exploration Rovers and Its Evaluation based on Wheel Slip Dynamics
— In this paper, a path planning and its evaluation method is described with taking into account wheel slip dynamics of lunar/planetary exploration rovers. The surface of the pla...
Genya Ishigami, Keiji Nagatani, Kazuya Yoshida