{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:00Z","timestamp":1750307280586,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":6,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,4,15]],"date-time":"2010-04-15T00:00:00Z","timestamp":1271289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,4,15]]},"DOI":"10.1145\/1900008.1900072","type":"proceedings-article","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T16:13:47Z","timestamp":1292861627000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Generating three binary addition algorithms using reinforcement programming"],"prefix":"10.1145","author":[{"given":"Spencer","family":"White","sequence":"first","affiliation":[{"name":"Duvall, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tony","family":"Martinez","sequence":"additional","affiliation":[{"name":"Brigham Young University, Provo, UT"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Rudolph","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Charleston, SC"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,4,15]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"345","volume-title":"Advances in Neural Information Processing Systems","author":"Jaakkola T.","year":"1995","unstructured":"T. Jaakkola , S. P. Singh , and M. I. Jordan . Reinforcement learning algorithm for partially observable Markov decision problems . In G. Tesauro, D. Touretzky, and T. Leen, editors, Advances in Neural Information Processing Systems , volume 7 , pages 345 -- 352 . The MIT Press , 1995 . T. Jaakkola, S. P. Singh, and M. I. Jordan. Reinforcement learning algorithm for partially observable Markov decision problems. In G. Tesauro, D. Touretzky, and T. Leen, editors, Advances in Neural Information Processing Systems, volume 7, pages 345--352. The MIT Press, 1995."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1993.298674"},{"key":"e_1_3_2_1_3_1","volume-title":"Genetic Programming IV: Routine Human-Competitive Machine Intelligence","author":"Koza J. R.","year":"2003","unstructured":"J. R. Koza . Genetic Programming IV: Routine Human-Competitive Machine Intelligence . Kluwer Academic Publishers , 2003 . J. R. Koza. Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers, 2003."},{"key":"e_1_3_2_1_4_1","volume-title":"Machine Learning","author":"Mitchell T. M.","year":"1997","unstructured":"T. M. Mitchell . Machine Learning . McGraw-Hill , New York , 1997 . T. M. Mitchell. Machine Learning. McGraw-Hill, New York, 1997."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/551283"},{"key":"e_1_3_2_1_7_1","volume-title":"Reinforcement programming: A new technique in automatic algorithm development. Master's thesis","author":"White S. K.","year":"2006","unstructured":"S. K. White . Reinforcement programming: A new technique in automatic algorithm development. Master's thesis , Brigham Young University , 2006 . S. K. White. Reinforcement programming: A new technique in automatic algorithm development. Master's thesis, Brigham Young University, 2006."}],"event":{"name":"ACM SE '10: ACM Southeast Regional Conference","sponsor":["ACM Association for Computing Machinery"],"location":"Oxford Mississippi","acronym":"ACM SE '10"},"container-title":["Proceedings of the 48th Annual Southeast Regional Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1900008.1900072","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1900008.1900072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:29Z","timestamp":1750244369000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1900008.1900072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,15]]},"references-count":6,"alternative-id":["10.1145\/1900008.1900072","10.1145\/1900008"],"URL":"https:\/\/doi.org\/10.1145\/1900008.1900072","relation":{},"subject":[],"published":{"date-parts":[[2010,4,15]]},"assertion":[{"value":"2010-04-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}