Λεπτομέρειες βιβλιογραφικής εγγραφής
| Τίτλος: |
Complexity of Finite-Horizon Markov Decision Process Problems. |
| Συγγραφείς: |
Mundhenk, Martin, Goldsmith, Judy |
| Πηγή: |
Journal of the ACM. Jul2000, Vol. 47 Issue 4, p681. 40p. 4 Diagrams, 3 Charts. |
| Θεματικοί όροι: |
*Markov processes, Finite element method data processing |
| Περίληψη: |
Discusses a study on the complexity of computing the optimal control policy assuming the time the process will run is finite. Details on the Markov decision processes; Factors that compound the complexity of computing optimal policy; Policy evaluation for compressed representations. |
| Βάση Δεδομένων: |
Business Source Index |