Mastering construction heuristics with self-play deep reinforcement learning
Learning heuristics without expert experience to construct solutions automatically has
always been a critical challenge of combinatorial optimization. It is also the pursuit of …
always been a critical challenge of combinatorial optimization. It is also the pursuit of …
Implementation of digital memcomputing using standard electronic components
YH Zhang, M Di Ventra - International Journal of Circuit Theory …, 2024 - Wiley Online Library
Summary Digital MemComputing machines (DMMs), which employ nonlinear dynamical
systems with memory (time non‐locality), have proven to be a robust and scalable …
systems with memory (time non‐locality), have proven to be a robust and scalable …
Scaling up prime factorization with self-organizing gates: A memcomputing approach
We report preliminary results on using the MEMCPU\texttrademark {} Platform to compute
the prime factorization of large biprimes. The first approach, the direct model, directly returns …
the prime factorization of large biprimes. The first approach, the direct model, directly returns …
Hardware implementation of digital memcomputing on small-size FPGAs
DC Nguyen, YH Zhang, M Di Ventra… - 2023 IEEE 66th …, 2023 - ieeexplore.ieee.org
Memcomputing is a novel computing paradigm beyond the von-Neumann one. Its digital
version is designed for the efficient solution of combinatorial optimization problems, which …
version is designed for the efficient solution of combinatorial optimization problems, which …
Memcomputing integer linear programming
FL Traversa, M Di Ventra - arXiv preprint arXiv:1808.09999, 2018 - arxiv.org
Integer linear programming (ILP) encompasses a very important class of optimization
problems that are of great interest to both academia and industry. Several algorithms are …
problems that are of great interest to both academia and industry. Several algorithms are …
A Memcomputing Approach to Prime Factorization
We report preliminary results on using the MEMCPU™ Platform to compute the prime
factorization of large biprimes. The approach described here uses a congruence model that …
factorization of large biprimes. The approach described here uses a congruence model that …
On the universality of memcomputing machines
Universal memcomputing machines (UMMs) represent a novel computational model in
which memory (time nonlocality) accomplishes both tasks of storing and processing of …
which memory (time nonlocality) accomplishes both tasks of storing and processing of …
[HTML][HTML] Directed percolation and numerical stability of simulations of digital memcomputing machines
YH Zhang, M Di Ventra - Chaos: An Interdisciplinary Journal of …, 2021 - pubs.aip.org
Digital memcomputing machines (DMMs) are a novel, non-Turing class of machines
designed to solve combinatorial optimization problems. They can be physically realized with …
designed to solve combinatorial optimization problems. They can be physically realized with …
Aircraft loading optimization: Memcomputing the 5th airbus problem
FL Traversa - arXiv preprint arXiv:1903.08189, 2019 - arxiv.org
On the January 22nd 2019, Airbus launched a quantum computing challenge to solve a set
of problems relevant for the aircraft life cycle (https://www. airbus. com/newsroom/press …
of problems relevant for the aircraft life cycle (https://www. airbus. com/newsroom/press …
Memcomputing for accelerated optimization
J Aiken, FL Traversa - arXiv preprint arXiv:2003.10644, 2020 - arxiv.org
In this work, we introduce the concept of an entirely new circuit architecture based on the
novel, physics-inspired computing paradigm: Memcomputing. In particular, we focus on …
novel, physics-inspired computing paradigm: Memcomputing. In particular, we focus on …