91 search results - page 3 / 19 » Finding an Optimal Path without Growing the Tree |
ICRA
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose a more robust robot programming by demonstration system planner that produces a reproduction path which satisfies statistical constraints derived from demonstration traj...
MMNS
2004
13 years 9 months ago
2004
Existing multicast traffic engineering (TE) solutions tend to use explicit routing through MPLS tunnels. In this paper we shift away from this overlay approach and address the band...
ISCAS
2003
IEEE
14 years 1 months ago
2003
IEEE
We present an equation-based transistor size optimizer that minimizes delay of custom circuits. Our method uses static timing analysis to find the critical paths and numerical met...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...