22 citations · 55 across the 4 of their papers we have counts for
4 papers
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…
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…
Analog Feedback-Controlled Memristor programming Circuit for analog Content Addressable Memory
Jiaao Yu, Paul-Philipp Manea, Sara Ameli +3
Recent breakthroughs in associative memories suggest that silicon memories are coming closer to human memories, especially for memristive Content Addressable Memories (CAMs) which…