{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:35:32Z","timestamp":1725593732131},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200083"},{"type":"electronic","value":"9783642200090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20009-0_52","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T18:32:23Z","timestamp":1309026743000},"page":"327-332","source":"Crossref","is-referenced-by-count":1,"title":["A Continuous-Time Markov Decision Process for Infrastructure Surveillance"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Ott","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"issue":"6","key":"52_CR1_52","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1287\/opre.51.6.850.24925","volume":"51","author":"D.P. de Farias","year":"2003","unstructured":"D.P. de Farias and B. van Roy. The Linear Programming Approach to Approximate Dynamic Programming. Operations Research, 51(6): 850\u2013865, November\u2013December 2003.","journal-title":"Operations Research"},{"issue":"2","key":"52_CR2_52","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1111\/j.2517-6161.1979.tb01068.x","volume":"41","author":"J.C. Gittins","year":"1979","unstructured":"J.C. Gittins. Bandit Processes and Dynamic Allocation Indices. Journal of the Royal Statistical Society. Series B (Methodological), 41(2): 148\u2013164, 1979.","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"issue":"1","key":"52_CR3_52","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1613\/jair.1000","volume":"19","author":"Carlos Guestrin","year":"2003","unstructured":"Carlos Guestrin, Daphne Koller, Ronald Parr, and Shobha Venkataraman. Efficient Solution Algorithms for Factored MDPs. Journal of Artificial Intelligence Research, 19(1): 399\u2013468, July 2003.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"52_CR4_52","doi-asserted-by":"crossref","unstructured":"Warren B. Powell. Approximate Dynamic Programming: Solving the Curses of Dimensionality. Wiley Series in Probability and Statistics. John Wiley & Sons, 2007.","DOI":"10.1002\/9780470182963"},{"key":"52_CR5_52","unstructured":"Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics. John Wiley & Sons, 2005."},{"key":"52_CR6_52","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2307\/3214163","volume":"25","author":"P. Whittle","year":"1988","unstructured":"P.Whittle. Restless Bandits: Activity Allocation in a Changing World. Journal of Applied Probability, 25: 287\u2013298, 1988.","journal-title":"Journal of Applied Probability"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20009-0_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:59:27Z","timestamp":1619787567000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20009-0_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200083","9783642200090"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20009-0_52","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2011]]}}}