Sciweavers

3678 search results - page 121 / 736
» On the Stable Paths Problem
Sort
View
165
Voted
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
14 years 10 months ago
Global reachability and path planning for planetary exploration with montgolfiere balloons
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, ...
CPAIOR
2011
Springer
14 years 4 months ago
Upgrading Shortest Paths in Networks
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
Bistra N. Dilkina, Katherine J. Lai, Carla P. Gome...
100
Voted
CCCG
1993
15 years 2 months ago
Shortest Paths for a Two-robot Rendez-vous
In this paper, we consider an optimalmotionplanning problem for a pair of point robots in a planar environment with polygonal obstacles. We seek a pair of paths upon which the rob...
Erik L. Wynters, Joseph S. B. Mitchell
142
Voted
OL
2011
277views Neural Networks» more  OL 2011»
14 years 7 months ago
An exact algorithm for minimum CDS with shortest path constraint in wireless networks
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...
Ling Ding, Xiaofeng Gao, Weili Wu, Wonjun Lee, Xu ...
99
Voted
WWIC
2007
Springer
102views Communications» more  WWIC 2007»
15 years 7 months ago
SCTP Performance Issue on Path Delay Differential
This paper studies the effect of path delay on SCTP performance. It focuses on the SCTP fast retransmit algorithm and demonstrates that the performance in the current retransmissio...
Yuansong Qiao, Enda Fallon, Liam Murphy, John Murp...