22 search results - page 3 / 5 » Time Parameterization of Humanoid-Robot Paths |
ICRA
1995
IEEE
15 years 29 days ago
1995
IEEE
The control of nonholonomic and underactuated systems with symmetry is illustrated by the problem of controlling a bicycle. We derive a controller which, using steering and rear-w...
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
WALCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...