Sciweavers

672 search results - page 15 / 135
» Policy Search by Dynamic Programming
Sort
View
IROS
2007
IEEE
127views Robotics» more  IROS 2007»
14 years 1 months ago
Dynamic redistribution of a swarm of robots among multiple sites
Abstract— We present an approach for the dynamic assignment and reassignment of a large team of homogeneous robotic agents to multiple locations with applications to search and r...
Ádám M. Halász, M. Ani Hsieh,...
DATE
2010
IEEE
163views Hardware» more  DATE 2010»
13 years 12 months ago
Enhanced Q-learning algorithm for dynamic power management with performance constraint
- This paper presents a novel power management techniques based on enhanced Q-learning algorithms. By exploiting the submodularity and monotonic structure in the cost function of a...
Wei Liu, Ying Tan, Qinru Qiu
SACMAT
2009
ACM
14 years 2 months ago
Dynamic mandatory access control for multiple stakeholders
In this paper, we present a mandatory access control system that uses input from multiple stakeholders to compose policies based on runtime information. In the emerging ubiquitous...
Vikhyath Rao, Trent Jaeger
ACL
2010
13 years 5 months ago
Dynamic Programming for Linear-Time Incremental Parsing
Incremental parsing techniques such as shift-reduce have gained popularity thanks to their efficiency, but there remains a major problem: the search is greedy and only explores a ...
Liang Huang, Kenji Sagae
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos