A scalable CMOS Ising computer featuring sparse and reconfigurable spin interconnects for solving combinatorial optimization problems

No existing algorithms can find exact solutions to the combinatorial optimization problems (COPs) classified as non-deterministic polynomial-time (NP) hard problems. Alternatively, Ising computer based on the Ising model and annealing process has recently drawn significant attention. The Ising compu...

全面介紹

Saved in:
書目詳細資料
Main Authors: Su, Yuqi, Mu, Junjie, Kim, Hyunjoon, Kim, Bongjin
其他作者: School of Electrical and Electronic Engineering
格式: Article
語言:English
出版: 2022
主題:
在線閱讀:https://hdl.handle.net/10356/163745
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!