{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T05:26:40Z","timestamp":1744435600790},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[1986,5]]},"DOI":"10.1109\/tpami.1986.4767794","type":"journal-article","created":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T21:35:15Z","timestamp":1233264915000},"page":"313-326","source":"Crossref","is-referenced-by-count":11,"title":["A Dynamic Programming Approach to Sequential Pattern Recognition"],"prefix":"10.1109","volume":"PAMI-8","author":[{"given":"King-Sun","family":"Fu","sequence":"first","affiliation":[]},{"given":"Y. T.","family":"Chien","sequence":"additional","affiliation":[]},{"given":"Gerald P.","family":"Cardillo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","author":"bellman","year":"1957","journal-title":"Dynamic Programming"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5219888"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053863"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.2307\/2985407","volume":"10","author":"lindley","year":"1961","journal-title":"Applied Statistics"},{"key":"ref11","author":"fu","year":"1967","journal-title":"Optimum finite sequential pattern recognition"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.47.3.338"},{"key":"ref8","author":"fishburn","year":"1965","journal-title":"A general theory of finite sequential decision processes"},{"key":"ref7","first-page":"627","article-title":"The optimum choice of the instant for stopping a Markov process","volume":"4","author":"dynkin","year":"1963","journal-title":"Journal of Soviet Mathematics"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1962.5219431"},{"key":"ref9","author":"howard","year":"1960","journal-title":"Dynamic Programming and Markov Processes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1957.5222035"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/34\/4767784\/04767794.pdf?arnumber=4767794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:53:32Z","timestamp":1638219212000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4767794\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":11,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tpami.1986.4767794","relation":{},"ISSN":["0162-8828"],"issn-type":[{"value":"0162-8828","type":"print"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}