Amoeba Optimization Engine

TL;DR: The Fujitsu Digital Annealer as mentioned in this paper is designed to solve fully connected quadratic unconstrained binary optimization (QUBO) problems and is implemented on application-specific CMOS hardware and currently solves problems of up to 1024 variables.

TL;DR: Ising machines as discussed by the authors are special-purpose hardware solvers that aim to find the absolute or approximate ground states of the Ising model, which is of fundamental computational interest because any problem in the complexity class NP can be formulated as an Ising problem with only polynomial overhead and thus a scalable Ising machine that outperforms existing standard digital computers could have a huge impact for practical applications.

TL;DR: This work explores the space of all possible partial priority orderings as part of a novel systematic and conflict-driven combinatorial search framework and develops new theoretical results that explore the limitations of prioritized planning, in terms of completeness and optimality, for the first time.

TL;DR: In this article, the authors proposed an algorithm based on classical mechanics, which is obtained by modifying a previously proposed algorithm called simulated bifurcation, to achieve not only high speed by parallel computing but also high solution accuracy for problems with up to one million binary variables.