Sciweavers

3678 search results - page 74 / 736
» On the Stable Paths Problem
Sort
View
COSIT
2003
Springer
132views GIS» more  COSIT 2003»
15 years 8 months ago
"Simplest" Paths: Automated Route Selection for Navigation
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
Matt Duckham, Lars Kulik
ICNS
2009
IEEE
15 years 1 months ago
Evaluation of Free-Riding Traffic Problem in Overlay Routing and Its Mitigation Method
Recent research on overlay networks has revealed that user-perceived network performance could be improved by an overlay routing mechanism. The effectiveness of overlay routing is ...
Go Hasegawa, Yuichiro Hiraoka, Masayuki Murata
134
Voted
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 3 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
135
Voted
IJRR
2008
115views more  IJRR 2008»
15 years 3 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin
IROS
2009
IEEE
147views Robotics» more  IROS 2009»
15 years 10 months ago
Dynamics morphing from regulator to oscillator on bipedal control
— A stable non-linear oscillator for autonomous biped stepping control is designed in a top-down manner by morphing dynamics of standing regulator. It resolves three problems whi...
Tomomichi Sugihara