Sciweavers

1815 search results - page 19 / 363
» Path Planning for Network Performance
Sort
View
GIS
2010
ACM
13 years 6 months ago
A case for time-dependent shortest path computation in spatial networks
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
IROS
2007
IEEE
158views Robotics» more  IROS 2007»
14 years 1 months ago
Factor-guided motion planning for a robot arm
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
Jaesik Choi, Eyal Amir
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 7 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
EOR
2008
59views more  EOR 2008»
13 years 7 months ago
Spectrum planning and performance evaluation between heterogeneous satellite networks
A new network has been recently proposed for the provision of fixed broadband services via high altitude platform stations (HAPS) in the 48/47 GHz band. One of the critical issues...
Vassilis F. Milas, Demosthenes Vouyioukas, Nektari...
IJCAI
1989
13 years 8 months ago
Solving Time-Dependent Planning Problems
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
Mark S. Boddy, Thomas Dean