6 papers
Decomposing Large-Scale Ising Problems on FPGAs: A Hybrid Hardware Approach
Ruihong Yin, Yue Zheng, Chaohui Li +6
Emerging analog computing substrates, such as oscillator-based Ising machines, offer rapid convergence times for combinatorial optimization but often suffer from limited scalabilit…
Extractive summarization on a CMOS Ising machine
Ziqing Zeng, Abhimanyu Kumar, Ahmet Efe +4
Extractive summarization (ES) aims to generate a concise summary by selecting a subset of sentences from a document while maximizing relevance and minimizing redundancy. Although m…
On Solving Structured SAT on Ising Machines: A Semiprime Factorization Study
Ahmet Efe, Hüsrev Cılasun, Abhimanyu Kumar +9
Ising machines are emerging as a new technology for solving various classes of computationally hard problems of practical importance, yet their limits on structured SAT workloads,…
Supporting Higher-Order Interactions in Practical Ising Machines
Nafisa Sadaf Prova, Hüsrev Cılasun, Abhimanyu Kumar +3
Ising machines as hardware solvers of combinatorial optimization problems (COPs) can efficiently explore large solution spaces due to their inherent parallelism and physics-based d…
HETRI: Heterogeneous Ising Multiprocessing
Ahmet Efe, Hüsrev Cılasun, Hüsrev Cılasun +6
Ising machines are effective solvers for complex combinatorial optimization problems. The idea is mapping the optimal solution(s) to a combinatorial optimization problem to the min…
DROID: Discrete-Time Simulation for Ring-Oscillator-Based Ising Design
Abhimanyu Kumar, Ramprasath S., Chris H. Kim +2
Many combinatorial problems can be mapped to Ising machines, i.e., networks of coupled oscillators that settle to a minimum-energy ground state, from which the problem solution is…