158 search results - page 10 / 32 » The Cover Time, the Blanket Time, and the Matthews Bound |
NETWORKS
2008
14 years 9 months ago
2008
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
95
Voted
IJRR
2008
14 years 9 months ago
2008
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
85
Voted
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
77
Voted
ICRA
2002
IEEE
15 years 2 months ago
2002
IEEE
Previous work [3, 6, 9, 8, 7, 1] has presented the time optimal trajectories for three classes of non-holonomic mobile robots: steered cars that can only go forwards, steered cars...
JMLR
2006
14 years 9 months ago
2006
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...