1 citations · 1 across the 2 of their papers we have counts for
5 papers
Phases of memristive circuits via an interacting disorder approach
Francesco Caravelli, Forrest C. Sheldon
We study the phase diagram of memristive circuit models in the replica-symmetric case using a novel Lyapunov function for the dynamics of these devices. Effectively, the model we p…
Critical branching processes in digital memcomputing machines
Sean R. B. Bearden, Forrest C. Sheldon, Massimiliano Di Ventra
Memcomputing is a novel computing paradigm that employs time non-locality (memory) to solve combinatorial optimization problems. It can be realized in practice by means of non-line…
Taming a non-convex landscape with dynamical long-range order: memcomputing Ising benchmarks
Forrest Sheldon, Fabio L. Traversa, Massimiliano Di Ventra
Recent work on quantum annealing has emphasized the role of collective behavior in solving optimization problems. By enabling transitions of clusters of variables, such solvers are…
Stress-testing memcomputing on hard combinatorial optimization problems
Forrest Sheldon, Pietro Cicotti, Fabio L. Traversa +1
Memcomputing is a novel paradigm of computation that utilizes dynamical elements with memory to both store and process information on the same physical location. Its building block…
Evidence of an exponential speed-up in the solution of hard optimization problems
Fabio L. Traversa, Pietro Cicotti, Forrest Sheldon +1
Optimization problems pervade essentially every scientific discipline and industry. Many such problems require finding a solution that maximizes the number of constraints satisfied…