Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3070| Title: | Polynomial time algorithms for finite horizon, stationary Markov decision processes |
| Authors: | Tseng, Paul. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. |
| Keywords: | TK7855.M41 E3845 no.1793 |
| Issue Date: | 5-Jun-2013 |
| Publisher: | Massachusetts Institute of Technology, Laboratory for Information and Decision Systems] |
| Description: | by Paul Tseng. Cover title. Includes bibliographical references. Supported by the National Science Foundation. NSF-ECS-8519058 Supported by the Army Research Office. DAAL03-86-K-0171 |
| URI: | http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
| Other Identifiers: | http://hdl.handle.net/1721.1/3070 |
| Appears in Collections: | MIT Items |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.