Results 41 to 50 of about 20,200 (225)
An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity. [PDF]
PLoS ONE, 2015 Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes ...
Changki Hong +3 more
doaj +1 more source
A parallel attractor-finding algorithm based on Boolean satisfiability for genetic regulatory networks. [PDF]
PLoS ONE, 2014 In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network.
Wensheng Guo +4 more
doaj +1 more source
Iraqi Journal for Computer Science and Mathematics, 2022 The Boolean Satisfiability Problem (BSAT) is one of the most important decision problems in mathematical logic and computational sciences for determining whether or not a solution to a Boolean formula.. Hopfield neural network (HNN) is one of the major
Hamza Abubakar +2 more
doaj +1 more source
Expected number of locally maximal solutions for random Boolean CSPs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 For a large number of random Boolean constraint satisfaction problems, such as random $k$-SAT, we study how the number of locally maximal solutions evolves when constraints are added.
Nadia Creignou +2 more
doaj +1 more source
Oscillator-Inspired Dynamical Systems to Solve Boolean Satisfiability
IEEE Journal on Exploratory Solid-State Computational Devices and Circuits, 2023 Dynamical systems can offer a novel non-Boolean approach to computing. Specifically, the natural minimization of energy in the system is a valuable property for minimizing the objective functions of combinatorial optimization problems, many of which are ...
Mohammad Khairul Bashar +2 more
doaj +1 more source
Solving the Satisfiability Problem Through Boolean Networks [PDF]
, 2000 In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve SAT problem by simulating the BN dynamics. We prove that BN fixed points correspond to the SAT solutions.
Milano M., Roli A.
openaire +3 more sources
Genetic Algorithm for Restricted Maximum k-Satisfiability in the Hopfield Network
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 The restricted Maximum k-Satisfiability MAX- kSAT is an enhanced Boolean satisfiability counterpart that has attracted numerous amount of research. Genetic algorithm has been the prominent optimization heuristic algorithm to solve constraint optimization
Mohd Shareduwan Bin Mohd Kasihmuddin +2 more
doaj +1 more source
IEEE Transactions on Quantum Engineering, 2021 Experimental demonstrations of quantum annealing with “native” implementation of Boolean logic Hamiltonians are reported. As a superconducting integrated circuit, a problem Hamiltonian whose set of ground states is consistent with a given ...
Daisuke Saida +6 more
doaj +1 more source
The Phase Diagram of 1-in-3 Satisfiability Problem [PDF]
, 2007 We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and probability of ...
Andrea Sportiello +12 more
core +2 more sources
Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions
Scientific Reports, 2018 Boolean satisfiability (k-SAT) is an NP-complete (k ≥ 3) problem that constitute one of the hardest classes of constraint satisfaction problems. In this work, we provide a proof of concept hardware based analog k-SAT solver, that is built using Magnetic ...
Parami Wijesinghe +2 more
doaj +1 more source