{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:47Z","timestamp":1750220087780,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T00:00:00Z","timestamp":1655078400000},"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":[[2022,6,13]]},"DOI":"10.1145\/3520306.3534503","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:10:00Z","timestamp":1654873800000},"page":"37-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Using q-learning to select the best among functionally equivalent implementations"],"prefix":"10.1145","author":[{"given":"Meggie van den","family":"Oever","sequence":"first","affiliation":[{"name":"Spring Hill College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lauren E.","family":"Grimley","sequence":"additional","affiliation":[{"name":"Spring Hill College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard M.","family":"Veras","sequence":"additional","affiliation":[{"name":"University of Oklahoma, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055531.1055532"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591635.2667174"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00087-9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2873289"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1356052.1356053"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1994.6.6.1185"},{"key":"e_1_3_2_1_7_1","volume-title":"Reinforcement Learning: A Survey. ( 1996 ). https:\/\/doi.org\/10.48550\/ARXIV.CS\/ 9605103","author":"Kaelbling L. P.","year":"1996","unstructured":"L. P. Kaelbling , M. L. Littman , and A. W. Moore . 1996 . Reinforcement Learning: A Survey. ( 1996 ). https:\/\/doi.org\/10.48550\/ARXIV.CS\/ 9605103 L. P. Kaelbling, M. L. Littman, and A. W. Moore. 1996. Reinforcement Learning: A Survey. ( 1996 ). https:\/\/doi.org\/10.48550\/ARXIV.CS\/ 9605103"},{"key":"e_1_3_2_1_8_1","unstructured":"Yuxi Li. 2017. Deep Reinforcement Learning: An Overview. https:\/\/doi.org\/10.48550\/ARXIV.1701.07274   Yuxi Li. 2017. Deep Reinforcement Learning: An Overview. https:\/\/doi.org\/10.48550\/ARXIV.1701.07274"},{"key":"e_1_3_2_1_9_1","unstructured":"Yujia Li David Choi Junyoung Chung Nate Kushman Julian Schrittwieser R\u00e9mi Leblond Tom Eccles James Keeling Felix Gimeno Agustin Dal Lago Thomas Hubert Peter Choy Cyprien de Masson d'Autume Igor Babuschkin Xinyun Chen Po-Sen Huang Johannes Welbl Sven Gowal Alexey Cherepanov James Molloy Daniel J. Mankowitz Esme Sutherland Robson Pushmeet Kohli Nando de Freitas Koray Kavukcuoglu and Oriol Vinyals. 2022. Competition-Level Code Generation with AlphaCode. ( 2022 ). https:\/\/doi.org\/10.48550\/ ARXIV.2203.07814   Yujia Li David Choi Junyoung Chung Nate Kushman Julian Schrittwieser R\u00e9mi Leblond Tom Eccles James Keeling Felix Gimeno Agustin Dal Lago Thomas Hubert Peter Choy Cyprien de Masson d'Autume Igor Babuschkin Xinyun Chen Po-Sen Huang Johannes Welbl Sven Gowal Alexey Cherepanov James Molloy Daniel J. Mankowitz Esme Sutherland Robson Pushmeet Kohli Nando de Freitas Koray Kavukcuoglu and Oriol Vinyals. 2022. Competition-Level Code Generation with AlphaCode. ( 2022 ). https:\/\/doi.org\/10.48550\/ ARXIV.2203.07814"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2925987"},{"key":"e_1_3_2_1_11_1","volume-title":"High Performance Computing for Computational Science-VECPAR","author":"Marker Bryan","year":"2012","unstructured":"Bryan Marker , Jack Poulson , Don Batory , and Robert van de Geijn . 2013. Designing Linear Algebra Algorithms by Transformation: Mechanizing the Expert Developer . In High Performance Computing for Computational Science-VECPAR 2012 , Michel Dayd\u00e9, Osni Marques , and Kengo Nakajima (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg, 362-378. Bryan Marker, Jack Poulson, Don Batory, and Robert van de Geijn. 2013. Designing Linear Algebra Algorithms by Transformation: Mechanizing the Expert Developer. In High Performance Computing for Computational Science-VECPAR 2012, Michel Dayd\u00e9, Osni Marques, and Kengo Nakajima (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 362-378."},{"key":"e_1_3_2_1_12_1","unstructured":"Mohit Mayank. 2018. Reinforcement Learning with Q tables. https:\/\/itnext.io \/reinforcement-learning-with-q-tables-5f11168862c8   Mohit Mayank. 2018. Reinforcement Learning with Q tables. https:\/\/itnext.io \/reinforcement-learning-with-q-tables-5f11168862c8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017976211990"},{"key":"e_1_3_2_1_14_1","unstructured":"Amy McGovern and J Moss. 1998. Scheduling straight-line code using reinforcement learning and rollouts. Advances in neural information processing Systems 11 ( 1998 ).   Amy McGovern and J Moss. 1998. Scheduling straight-line code using reinforcement learning and rollouts. Advances in neural information processing Systems 11 ( 1998 )."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499368.2451150"},{"key":"e_1_3_2_1_16_1","volume-title":"Barto","author":"Sutton Richard S.","year":"2018","unstructured":"Richard S. Sutton and Andrew G . Barto . 2018 . Reinforcement Learning : An Introduction (second ed.). The MIT Press . Richard S. Sutton and Andrew G. Barto. 2018. Reinforcement Learning: An Introduction (second ed.). The MIT Press."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755561"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2764454"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2870650.2870654"},{"key":"e_1_3_2_1_20_1","volume-title":"Tyler Michael Smith, Robert van de Geijn, and Franz Franchetti.","author":"Veras Richard Michael","year":"2016","unstructured":"Richard Michael Veras , Tze Meng Low , Tyler Michael Smith, Robert van de Geijn, and Franz Franchetti. 2016 . Automating the Last-Mile for High Performance Dense Linear Algebra . ( 2016 ). https:\/\/doi.org\/ 10.48550\/ARXIV.1611.08035 Richard Michael Veras, Tze Meng Low, Tyler Michael Smith, Robert van de Geijn, and Franz Franchetti. 2016. Automating the Last-Mile for High Performance Dense Linear Algebra. ( 2016 ). https:\/\/doi.org\/ 10.48550\/ARXIV.1611.08035"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/16\/1\/071"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992698"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3264738.3264739"}],"event":{"name":"ARRAY '22: 8th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"San Diego CA USA","acronym":"ARRAY '22"},"container-title":["Proceedings of the 8th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520306.3534503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3520306.3534503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:09:31Z","timestamp":1750183771000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3520306.3534503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,13]]},"references-count":23,"alternative-id":["10.1145\/3520306.3534503","10.1145\/3520306"],"URL":"https:\/\/doi.org\/10.1145\/3520306.3534503","relation":{},"subject":[],"published":{"date-parts":[[2022,6,13]]},"assertion":[{"value":"2022-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}