194 search results - page 29 / 39 » Approximate dynamic programming: Lessons from the field |
AAAI
2006
13 years 9 months ago
2006
We study how to find plans that maximize the expected total utility for a given MDP, a planning objective that is important for decision making in high-stakes domains. The optimal...
AIPS
2009
13 years 9 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
CAV
2003
Springer
13 years 11 months ago
2003
Springer
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
CDC
2009
IEEE
14 years 14 days ago
2009
IEEE
— Timed Continuous Petri Net (TCPN) systems are piecewise linear models with input constraints that can approximate the dynamical behavior of a class of timed discrete event syst...
CISS
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract-Joint subcarrier, power and rate allocation in orthogonal frequency division multiple access (OFDMA) scheduling is investigated for both downlink and uplink wireless trans...