{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T06:03:54Z","timestamp":1780466634176,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"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":[[2024,6,23]]},"DOI":"10.1145\/3649329.3655989","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["HyCiM: A Hybrid Computing-in-Memory QUBO Solver for General Combinatorial Optimization Problems with Inequality Constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0885-2748","authenticated-orcid":false,"given":"Yu","family":"Qian","sequence":"first","affiliation":[{"name":"Zhejiang University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3910-5921","authenticated-orcid":false,"given":"Zeyu","family":"Yang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3628-3431","authenticated-orcid":false,"given":"Kai","family":"Ni","sequence":"additional","affiliation":[{"name":"University of Notre Dame, South Bend, IN, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0629-0325","authenticated-orcid":false,"given":"Alptekin","family":"Vardar","sequence":"additional","affiliation":[{"name":"Fraunhofer IPMS, Dresden, Sachsen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4672-8676","authenticated-orcid":false,"given":"Thomas","family":"Kampfe","sequence":"additional","affiliation":[{"name":"Fraunhofer IPMS, Dresden, Sachsen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4656-9545","authenticated-orcid":false,"given":"Xunzhao","family":"Yin","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, Zhejiang, China"},{"name":"Key Laboratory of CS&AUS of Zhejiang Province, Hangzhou, Zhejiang, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781119005384"},{"key":"e_1_3_2_1_2_1","first-page":"1","article-title":"An analog clock-free compute fabric base on continuous-time dynamical system for solving combinatorial optimization problems","author":"Chang M.","year":"2022","unstructured":"M. Chang et al., \"An analog clock-free compute fabric base on continuous-time dynamical system for solving combinatorial optimization problems,\" in IEEE CICC, 2022, pp. 1--2.","journal-title":"IEEE"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-024-46640-x"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42254-022-00440-8"},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"Fast solving complete 2000-node optimization using stochastic-computing simulated annealing,\" in 2022 ICECS","author":"Katsuki K.","year":"2022","unstructured":"K. Katsuki et al., \"Fast solving complete 2000-node optimization using stochastic-computing simulated annealing,\" in 2022 ICECS. IEEE, 2022, pp. 1--4.","journal-title":"IEEE"},{"key":"e_1_3_2_1_6_1","first-page":"64","article-title":"A 144kb annealing system composed of 9\u00d7 16kb annealing processor chips with scalable chip-to-chip connections for large-scale combinatorial optimization problems,\" in 2021 IEEE International Solid-State Circuits Conference (ISSCC), vol. 64","author":"Takemoto T.","year":"2021","unstructured":"T. Takemoto et al., \"A 144kb annealing system composed of 9\u00d7 16kb annealing processor chips with scalable chip-to-chip connections for large-scale combinatorial optimization problems,\" in 2021 IEEE International Solid-State Circuits Conference (ISSCC), vol. 64. IEEE, 2021, pp. 64--66.","journal-title":"IEEE"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41928-022-00749-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2021.3062821"},{"key":"e_1_3_2_1_9_1","volume-title":"A tutorial on formulating and using qubo models,\" arXiv preprint arXiv:1811.11538","author":"Glover F.","year":"2018","unstructured":"F. Glover et al., \"A tutorial on formulating and using qubo models,\" arXiv preprint arXiv:1811.11538, 2018."},{"key":"e_1_3_2_1_11_1","volume-title":"Pusey-Nazzaro et al., \"Adiabatic quantum optimization fails to solve the knapsack problem,\" arXiv preprint arXiv:2008.07456","author":"L.","year":"2020","unstructured":"L. Pusey-Nazzaro et al., \"Adiabatic quantum optimization fails to solve the knapsack problem,\" arXiv preprint arXiv:2008.07456, 2020."},{"key":"e_1_3_2_1_12_1","first-page":"90","volume-title":"Translating constraints into qubos for the quadratic knapsack problem,\" in International Conference on Computational Science","author":"Bontekoe T.","year":"2023","unstructured":"T. Bontekoe et al., \"Translating constraints into qubos for the quadratic knapsack problem,\" in International Conference on Computational Science. Springer, 2023, pp. 90--107."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-28217-8"},{"key":"e_1_3_2_1_14_1","first-page":"749","volume-title":"IEEE","author":"Afoakwa R.","year":"2021","unstructured":"R. Afoakwa et al., \"Brim: bistable resistively-coupled ising machine,\" in 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA). IEEE, 2021, pp. 749--760."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.aau0823"},{"key":"e_1_3_2_1_16_1","first-page":"824","article-title":"Convfifo: A crossbar memory pim architecture for convnets featuring first-in-first-out dataflow,\" in 29th ASP-DAC","author":"Zhao L.","year":"2024","unstructured":"L. Zhao et al., \"Convfifo: A crossbar memory pim architecture for convnets featuring first-in-first-out dataflow,\" in 29th ASP-DAC. IEEE, 2024, pp. 824--829.","journal-title":"IEEE"},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"In-situ stochastic training of mtj crossbar based neural networks","author":"Mondal A.","year":"2018","unstructured":"A. Mondal et al., \"In-situ stochastic training of mtj crossbar based neural networks,\" in Proceedings of the International Symposium on Low Power Electronics and Design, 2018, pp. 1--6.","journal-title":"Proceedings of the International Symposium on Low Power Electronics and Design"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41928-018-0117-x"},{"key":"e_1_3_2_1_19_1","article-title":"Design of ultra-compact content addressable memory exploiting 1t-1mtj cell","author":"Zhuo C.","year":"2022","unstructured":"C. Zhuo et al., \"Design of ultra-compact content addressable memory exploiting 1t-1mtj cell,\" IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022.","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41928-019-0321-3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/aisy.202200428"},{"key":"e_1_3_2_1_22_1","first-page":"25","volume-title":"In-memory computing with associative memories: a cross-layer perspective,\" in 2021 IEEE IEDM","author":"Hu X. S.","year":"2021","unstructured":"X. S. Hu et al., \"In-memory computing with associative memories: a cross-layer perspective,\" in 2021 IEEE IEDM, 2021, pp. 25--2."},{"issue":"4","key":"e_1_3_2_1_23_1","first-page":"1099","article-title":"Ferroelectric ternary content addressable memories for energy-efficient associative search","volume":"42","author":"Yin X.","year":"2022","unstructured":"X. Yin et al., \"Ferroelectric ternary content addressable memories for energy-efficient associative search,\" IEEE TCAD, vol. 42, no. 4, pp. 1099--1112, 2022.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_24_1","first-page":"29","volume-title":"IEEE","author":"Soliman T.","year":"2020","unstructured":"T. Soliman et al., \"Ultra-low power flexible precision fefet based analog in-memory computing,\" in IEDM. IEEE, 2020, pp. 29--2."},{"key":"e_1_3_2_1_25_1","first-page":"1","volume-title":"IEEE","author":"Saito D.","year":"2021","unstructured":"D. Saito et al., \"Analog in-memory computing in fefet-based 1t1r array for edge ai applications,\" in 2021 Symposium on VLSI Technology. IEEE, 2021, pp. 1--2."},{"key":"e_1_3_2_1_26_1","first-page":"131","article-title":"A circuit compatible accurate compact model for ferroelectric-fets","author":"Ni K.","year":"2018","unstructured":"K. Ni et al., \"A circuit compatible accurate compact model for ferroelectric-fets,\" in IEEE VLSI, 2018, pp. 131--132.","journal-title":"IEEE VLSI"},{"key":"e_1_3_2_1_27_1","first-page":"1543","volume-title":"Destiny: A tool for modeling emerging 3d nvm and edram caches,\" in DATE","author":"Poremba M.","year":"2015","unstructured":"M. Poremba et al., \"Destiny: A tool for modeling emerging 3d nvm and edram caches,\" in DATE. EDA Consortium, 2015, pp. 1543--1546."},{"key":"e_1_3_2_1_28_1","unstructured":"\"Quadratic Knapsack Problem dataset \" http:\/\/cedric.cnam.fr\/soutif\/QKP\/QKP.html."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41928-020-0436-6"},{"key":"e_1_3_2_1_30_1","first-page":"3","volume-title":"IEEE","author":"Shin J. H.","year":"2018","unstructured":"J. H. Shin et al., \"Hardware acceleration of simulated annealing of spin glass by rram crossbar array,\" in 2018 IEEE International Electron Devices Meeting (IEDM). IEEE, 2018, pp. 3--3."},{"key":"e_1_3_2_1_31_1","first-page":"21","volume-title":"IEEE","author":"Hong M.-C.","year":"2021","unstructured":"M.-C. Hong et al., \"In-memory annealing unit (imau): Energy-efficient (2000 tops\/w) combinatorial optimizer for solving travelling salesman problem,\" in IEDM. IEEE, 2021, pp. 21--3."},{"key":"e_1_3_2_1_32_1","first-page":"1","volume-title":"IEEE","author":"Taoka K.","year":"2021","unstructured":"K. Taoka et al., \"Simulated annealing algorithm & reram device co-optimization for computation-in-memory,\" in 2021 IEEE International Memory Workshop (IMW). IEEE, 2021, pp. 1--4."}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA","acronym":"DAC '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655989","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3655989","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:55Z","timestamp":1750295875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3655989"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":31,"alternative-id":["10.1145\/3649329.3655989","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3655989","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}