Sciweavers

1138 search results - page 176 / 228
» Feature Markov Decision Processes
Sort
View
ICTAI
2009
IEEE
14 years 9 months ago
TiMDPpoly: An Improved Method for Solving Time-Dependent MDPs
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
Emmanuel Rachelson, Patrick Fabiani, Fréd&e...
AAMAS
2011
Springer
14 years 7 months ago
Optimizing coalition formation for tasks with dynamically evolving rewards and nondeterministic action effects
We consider a problem domain where coalitions of agents are formed in order to execute tasks. Each task is assigned at most one coalition of agents, and the coalition can be reorg...
Majid Ali Khan, Damla Turgut, Ladislau Böl&ou...
TSMC
2011
258views more  TSMC 2011»
14 years 6 months ago
Cross-Entropy Optimization of Control Policies With Adaptive Basis Functions
—This paper introduces an algorithm for direct search of control policies in continuous-state discrete-action Markov decision processes. The algorithm looks for the best closed-l...
Lucian Busoniu, Damien Ernst, Bart De Schutter, Ro...
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 6 months ago
On the Semantics of Purpose Requirements in Privacy Policies
Privacy policies often place requirements on the purposes for which a governed entity may use personal information. For example, regulations, such as HIPAA, require that hospital ...
Michael Carl Tschantz, Anupam Datta, Jeannette M. ...
AAAI
2012
13 years 2 months ago
Planning in Factored Action Spaces with Symbolic Dynamic Programming
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
Aswin Raghavan, Saket Joshi, Alan Fern, Prasad Tad...