{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:21:32Z","timestamp":1760710892939,"version":"3.28.0"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:00:00Z","timestamp":1648857600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:00:00Z","timestamp":1648857600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,4,2]]},"DOI":"10.1109\/cgo53902.2022.9741272","type":"proceedings-article","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T19:51:20Z","timestamp":1648583480000},"page":"1-12","source":"Crossref","is-referenced-by-count":6,"title":["Solving PBQP-Based Register Allocation using Deep Reinforcement Learning"],"prefix":"10.1109","author":[{"given":"Minsu","family":"Kim","sequence":"first","affiliation":[{"name":"Seoul National University,Department of Electrical and Computer Engineering,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeong-Keun","family":"Park","sequence":"additional","affiliation":[{"name":"Seoul National University,Department of Electrical and Computer Engineering,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soo-Mook","family":"Moon","sequence":"additional","affiliation":[{"name":"Seoul National University,Department of Electrical and Computer Engineering,South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"283","article-title":"Register allocation: What does the np-completeness proof of chaitin et al. really prove? or revisiting register allocation: Why and how","volume-title":"International Workshop on Languages and Compilers for Parallel Computing","author":"Bouchez"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/872726.806984"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/177492.177575"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/229542.229546"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/330249.330250"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1772954.1772979"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2004.1281665"},{"article-title":"Register allocation in llvm 3.0","volume-title":"LLVM Developers\u2019 Meeting","author":"Olesen","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SCCC.2012.29"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199608)26:8<929::AID-SPE40>3.0.CO;2-T"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.1998.742791"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/381694.378854"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2005.4"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375609"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/513829.513854"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11860990_21"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3427378"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1038\/nature24270"},{"key":"ref20","article-title":"Mastering chess and shogi by self-play with a general reinforcement learning algorithm","author":"Silver","year":"2017","journal-title":"arXiv preprint arXiv:1712.01815"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-020-03051-4"},{"key":"ref22","first-page":"5360","article-title":"Thinking fast and slow with deep learning and tree search","author":"Anthony","year":"2017","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref23","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2016","journal-title":"arXiv preprint arXiv:1609.02907"},{"key":"ref24","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","author":"Defferrard","year":"2016","journal-title":"arXiv preprint arXiv:1606.09375"},{"key":"ref25","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"International Conference on Machine Learning","author":"Gilmer"},{"key":"ref26","article-title":"Inductive representation learning on large graphs","author":"Hamilton","year":"2017","journal-title":"arXiv preprint arXiv:1706.02216"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3358186"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ETS.2019.8791506"},{"key":"ref29","first-page":"397","article-title":"Using confidence bounds for exploitation-exploration trade-offs","volume-title":"Journal of Machine Learning Research","volume":"3","author":"Auer"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-011-9258-6"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1126\/science.aar6404"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref33","first-page":"448","article-title":"Batch normalization: Accelerating deep network training by reducing internal covariate shift","volume-title":"International conference on machine learning","author":"Ioffe"},{"issue":"1","key":"ref34","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151bds","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/780822.781141"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2019.00125"},{"key":"ref37","article-title":"Coloring big graphs with alphagozero","author":"Huang","year":"2019","journal-title":"arXiv preprint arXiv:1902.10162"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/LLVMHPCHiPar51896.2020.00008"}],"event":{"name":"2022 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)","start":{"date-parts":[[2022,4,2]]},"location":"Seoul, Korea, Republic of","end":{"date-parts":[[2022,4,6]]}},"container-title":["2022 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9741235\/9741095\/09741272.pdf?arnumber=9741272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T01:17:24Z","timestamp":1706059044000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9741272\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,2]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/cgo53902.2022.9741272","relation":{},"subject":[],"published":{"date-parts":[[2022,4,2]]}}}