534 search results - page 99 / 107 » Proving Termination of Rewrite Systems Using Bounds |
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
IROS
2007
IEEE
14 years 3 months ago
2007
IEEE
— This paper considers the problem of coordinating multiple vehicles with kinodynamic constraints that operate in the same partially-known environment. The vehicles are able to c...
SIGMETRICS
2005
ACM
14 years 2 months ago
2005
ACM
Scalability considerations drive the switch fabric design to evolve from output queueing to input queueing and further to combined input and crosspoint queueing (CICQ). However, f...
WADS
2005
Springer
14 years 2 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
ATAL
2004
Springer
14 years 2 months ago
2004
Springer
As of today no solely software-based solution that a priori protects the computation of any mobile code and/or mobile agent was presented. Furthermore, Algesheimer et al. [1], arg...