In this paper, a slimmed version of AmoebaSAT named 'AmoebaSATslim,' which omits the most resource-consuming part of interactions among variables, is proposed.

Abstract. The Boolean satisfiability problem (SAT) is an NP-complete combinatorial optimization problem, where fast SAT solvers are useful for various smart ...

To overcome the limitations, in this paper, we propose a slimmed version of. AmbSAT named 'AmoebaSATslim' (hereafter 'AmbSATslim') and implement it on a Zynq ...

A novel FPGA implementation of a bio-inspired stochastic local search algorithm called 'AmoebaSAT' on a Zynq board is proposed, which enables to tackle ...

The proposed algorithm is constructed according to a given instance of graph, and can find a minimum dominating set efficiently based on branch and bound search ...

Dive into the research topics of 'Resource-saving FPGA Implementation of the Satisfiability Problem Solver: AmoebaSATslim'. Together they form a unique ...

Jul 19, 2023 · Abstract. The Boolean satisfiability problem (SAT), an NP-complete problem, poses significant challenges for conventional general-purpose ...

Apr 25, 2024 · Resource-saving FPGA Implementation of the Satisfiability Problem Solver: AmoebaSATslim. FPT 2021: 1-5. [+][–]. Coauthor network. maximize. Note ...

Aug 5, 2024 · Resource-saving FPGA Implementation of the Satisfiability Problem Solver: AmoebaSATslim. FPT 2021: 1-5; 2020. [j16]. view. electronic edition ...

Resource-saving FPGA Implementation of the Satisfiability Problem Solver: AmoebaSATslim · Yi YanH. Amano +4 authors. S. Kasai. Computer Science, Engineering.