22 citations · 58 across the 8 of their papers we have counts for
9 papers
Reduction of interaction order in hard combinatorial optimization via conditionally independent degrees of freedom
Alexandru Ciobanu, David Dahmen, John Paul Strachan +1
Combinatorial optimization problems have a broad range of applications and map to physical systems with complex dynamics. Among them, the 3-SAT problem is prominent due to its NP-c…
A Poisson Jump-driven SDE Approach to Distributed Gradient Descent with Sparse Communication
Marc Weber, John Paul Strachan, Christian Ebenbauer
To bridge the gap between idealised communication models and the stochastic reality of networked systems, we introduce a framework for embedding asynchronous communication directly…
Nonlocal Monte Carlo via Reinforcement Learning
Dmitrii Dobrynin, Masoud Mohseni, John Paul Strachan
Optimizing or sampling complex cost functions of combinatorial optimization problems is a longstanding challenge across disciplines and applications. When employing family of conve…
Accelerating Hybrid XORCNF Boolean Satisfiability Problems Natively with In-Memory Computing
Haesol Im, Fabian Böhm, Giacomo Pedretti +14
The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit desig…
Hardware-Compatible Single-Shot Feasible-Space Heuristics for Solving the Quadratic Assignment Problem
Haesol Im, Chan-Woo Yang, Moslem Noori +10
Research into the development of special-purpose computing architectures designed to solve quadratic unconstrained binary optimization (QUBO) problems has flourished in recent year…
Solving Boolean satisfiability problems with resistive content addressable memories
Giacomo Pedretti, Fabian Böhm, Tinish Bhattacharya +15
Solving optimization problems is a highly demanding workload requiring high-performance computing systems. Optimization solvers are usually difficult to parallelize in conventional…
Roadmap to Neuromorphic Computing with Emerging Technologies
Adnan Mehonic, Daniele Ielmini, Kaushik Roy +50
The roadmap is organized into several thematic sections, outlining current computing challenges, discussing the neuromorphic computing approach, analyzing mature and currently util…
Energy landscapes of combinatorial optimization in Ising machines
Dmitrii Dobrynin, Adrien Renaudineau, Mohammad Hizzani +3
Physics-based Ising machines (IM) have been developed as dedicated processors for solving hard combinatorial optimization problems with higher speed and better energy efficiency. G…
Memristor-based hardware and algorithms for higher-order Hopfield optimization solver outperforming quadratic Ising machines
Mohammad Hizzani, Arne Heittmann, George Hutchinson +6
Ising solvers offer a promising physics-based approach to tackle the challenging class of combinatorial optimization problems. However, typical solvers operate in a quadratic energ…