22 citations · 22 across the 6 of their papers we have counts for
6 papers
Ising Acceleration for Multi-Robot Multi-Target Planning
Ahmet Efe, Recep B. Uludag, Chris H. Kim +1
Ising machines are emerging as promising hardware for combinatorial optimization. With recent advances in CMOS Ising technology, they are becoming attractive as low-power accelerat…
An FPGA-ASIC Co-Design Framework for Capacity-Constrained Physics-Based Ising Chips
Ruihong Yin, Yue Zheng, Chaohui Li +6
When a problem exceeds an analog Ising machine's spin capacity it cannot be solved in one shot: a digital orchestration layer must iteratively decompose the graph, clamp boundary s…
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 the Limits of Ising Machines for Circuit-Derived SAT
Ahmet Efe, Hüsrev Cılasun, Abhimanyu Kumar +9
Emerging Ising machines are promising for solving computationally hard optimization problems, yet their limits on structured, circuit-derived satisfiability (SAT) problems remain p…
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…
3SAT on an All-to-All-Connected CMOS Ising Solver Chip
Hüsrev Cılasun, Ziqing Zeng, Ramprasath S +6
This work solves 3SAT, a classical NP-complete problem, on a CMOS-based Ising hardware chip with all-to-all connectivity. The paper addresses practical issues in going from algorit…