Results 41 to 50 of about 770 (181)
Complete on Average Boolean Satisfiability
Journal of Complexity, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
In‐Memory Continuous‐Time SAT Solver Based on Bidirectional 11‐T SRAM Macro
Advanced Intelligent Systems, EarlyView.This article reported a continuous‐time (CT) Boolean satisfiability (SAT) problem solver using bidirectional 11T‐SRAM macro. The proposed system operates asynchronously using capacitor‐based gradient integration and maximizes the parallelism for SAT solving by in‐memory computing (IMC).
Dongseok Kwon +3 more
wiley +1 more source
Using Boinc Desktop Grid To Solve Large Scale Sat Problems
Computer Science, 2012 Many practically important combinatorial problems can be efficiently reducedto a problem of Boolean satisfiability (SAT). Therefore, the implementation ofdistributed algorithms for solving SAT problems is of great importance. In thisarticle we describe a
Mikhail Posypkin +2 more
doaj +1 more source
Physics‐Grounded Probabilistic Bits for Hardware‐Efficient Intelligent Inference and Optimization
Advanced Intelligent Systems, EarlyView.Si–SiNx interface traps are harnessed as a complementary metal–oxide–semiconductor‐compatible source of controllable randomness for probabilistic bits. Pulse‐width‐programmed stochastic capture converts nanoscale defect dynamics into Boltzmann‐consistent binary outputs, while a physics‐based Simulation Program with Integrated Circuit Emphasis model ...
Dokyoung Lee +3 more
wiley +1 more source
Boolean satisfiability in quantum compilation
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2019 Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program and the low-level instructions, quantum compilation is split into a multi-stage flow consisting of ...
Mathias Soeken +5 more
openaire +3 more sources
Finding Minimum‐Cost Explanations for Predictions Made by Tree Ensembles
Software: Practice and Experience, Volume 56, Issue 6, Page 615-642, June 2026.ABSTRACT The ability to reliably explain why a machine learning model arrives at a particular prediction is crucial when used as decision support by human operators of critical systems. The provided explanations must be provably correct, and preferably without redundant information, called minimal explanations.
John Törnblom +2 more
wiley +1 more source
Fault Tolerant Boolean Satisfiability
Journal of Artificial Intelligence Research, 2006 A delta-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) where it is possible to recover ...
openaire +4 more sources
Advanced Physics Research, Volume 5, Issue 5, May 2026.This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim +3 more
wiley +1 more source
MAX-SAT Problem using Hybrid Harmony Search Algorithm
Journal of Intelligent Systems, 2018 Maximum Satisfiability problem is an optimization variant of the Satisfiability problem (SAT) denoted as MAX-SAT. The aim of this problem is to find Boolean variable assignment that maximizes the number of satisfied clauses in the Boolean formula.
Abu Doush Iyad +3 more
doaj +1 more source
Engineering Reports, Volume 8, Issue 2, February 2026.Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
wiley +1 more source