Results 191 to 200 of about 20,200 (225)
Exploring the intersection of natural sciences and information technology via entropy and randomness. [PDF]
Nat CommunLuescher AM, Heckel R, Grass RN.
europepmc +1 more source
Power system fault diagnosis with quantum computing and efficient gate decomposition. [PDF]
Sci RepFei X +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Modified Neural Net for the Boolean Satisfiability Problem
2015 International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE), 2015A modified Hopfield Artificial Neural Network is proposed to solve effectively and efficiently Boolean Satisfiability (SAT) NP-hard problems. The proposed Neural Network is compared against other traditional methods employed in this field, such as Greedy SAT and Genetic Algorithms for SAT.
Manuel Mejia-Lavalle +3 more
exaly +2 more sources
On the Structure of the Boolean Satisfiability Problem: A Survey
ACM Computing Surveys, 2022The Booleansatisfiability problem (SAT)is a fundamental NP-complete decision problem in automated reasoning and mathematical logic. As evidenced by the results of SAT competitions, the performance of SAT solvers varies substantially between different SAT categories (random, crafted, and industrial).
Tasniem Nasser Al-Yahya +2 more
openaire +1 more source
Scalable parallel solver of boolean satisfiability problems
2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), 2018One of the current trends in high-performance computing (HPC) is applying its possibilities to solve the Boolean satisfiability problem (SAT). SAT is the fundamental problem of mathematical logic and the computational theory. Many of the most important Data and Life Sciences problems can be formulated as SAT, in particular, the Regulation in Animals ...
Vera G. Bogdanova, Sergey A. Gorsky
openaire +1 more source
A quantum annealing approach for boolean satisfiability problem
Proceedings of the 53rd Annual Design Automation Conference, 2016Quantum annealing device has shown a great potential in solving discrete problems that are theoretically and empirically hard. Boolean Satisfiability (SAT) problem, determining if there is an assignment of variables that satisfies a given Boolean function, is the first proven NP-complete problem widely used in various domains.
Juexiao Su, Tianheng Tu, Lei He 0001
openaire +1 more source
A NN algorithm for Boolean satisfiability problems
Proceedings of International Conference on Neural Networks (ICNN'96), 2002Satisfiability (SAT) refers to the task of finding a truth assignment that makes an arbitrary Boolean expression true. This paper compares a neural network algorithm (NNSAT) with GSAT, a greedy algorithm for solving satisfiability problems. GSAT can solve problem instances that are difficult for traditional satisfiability algorithms.
openaire +1 more source
Formal Verification Techniques Based on Boolean Satisfiability Problem
Journal of Computer Science and Technology, 2005This paper exploits Boolean satisfiability problem in equivalence checking and model checking respectively. A combinational equivalence checking method based on incremental satisfiability is presented. This method chooses the candidate equivalent pairs with some new techniques, and uses incremental satisfiability algorithm to improve its performance ...
Xiaowei Li 0001 +2 more
openaire +1 more source
Quantum Algorithm for the Boolean Satisfiability Problem
2019In questo rapporto tecnico faremo una breve introduzione alla computazione quantistica, per poi presentare l'algoritmo di Grover ed una sua applicazione. La computazione quantistica si basa sui qubits, sistemi quantistici a due livelli che possono trovarsi in sovrapposizioni di stati.
Rende, R., Plastina, F., Mastroianni, C.
openaire +2 more sources