332 search results - page 26 / 67 » Ranking policies in discrete Markov decision processes |
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
Mediation is the process of decomposing a task into subtasks, finding agents suitable for these subtasks and negotiating with agents to obtain commitments to execute these subtas...
JMLR
2006
13 years 8 months ago
2006
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 ...
CSFW
2010
IEEE
13 years 11 months ago
2010
IEEE
—Although policy compliance testing is generally treated as a binary decision problem, the evidence gathered during the trust management process can actually be used to examine t...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Factored Markov Decision Processes is the theoretical framework underlying multi-step Learning Classifier Systems research. This framework is mostly used in the context ...