1224 search results - page 30 / 245 » Theory decision by decomposition |
CSCLP
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We adopt Benders’ decomposition algorithm to solve scenariobased Stochastic Constraint Programs (SCPs) with linear recourse. Rather than attempting to solve SCPs via a ...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...
ICMLA
2009
13 years 7 months ago
2009
We describe a system that successfully transfers value function knowledge across multiple subdomains of realtime strategy games in the context of multiagent reinforcement learning....
ISIPTA
2003
IEEE
14 years 3 months ago
2003
IEEE
We contrast three decision rules that extend Expected Utility to contexts where a convex set of probabilities is used to depict uncertainty: Γ-Maximin, Maximality, and E-admissib...
CADE
2009
Springer
14 years 10 months ago
2009
Springer
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...