Search Results - (("boolean satisfiability problem") OR ("boolean satisfiability problemy"))

Quantum Optimization with Arbitrary Connectivity Using Rydberg Atom Arrays by Nguyen, Minh-Thi, Liu, Jin-Guo, Wurtz, Jonathan, Lukin, Mikhail D., Wang, Sheng-Tao, Pichler, Hannes

“…Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et…”
Get full text

Accurate Modeling of Continuous-time SAT Solvers in SPICE by Pershin, Y. V., Nguyen, D. C.

“…Recently, there has been an increasing interest in employing dynamical systems as solvers of NP-complete problems. In this paper, we present accurate…”
Get full text

Parallel SAT framework to find clustering of differential characteristics and its applications by Sakamoto, Kosei, Ito, Ryoma, Isobe, Takanori

“…The most crucial but time-consuming task for differential cryptanalysis is to find a differential with a high probability. To tackle this task, we propose a…”
Get full text

Improving probability selection based weights for satisfiability problems by Fu, Huimin, Liu, Jun, Wu, Guanfeng, Xu, Yang, Sutcliffe, Geoff

“…Boolean Satisfiability problem (SAT) plays a prominent role in many domains of computer science and artificial intelligence due to its significant importance…”
Get full text

Context-sensitive fusion grammars and fusion grammars with forbidden context are universal by Lye, Aaron

“…Context-sensitive fusion grammars and fusion grammars with forbidden context are special cases of context-dependent fusion grammars where instead of finite…”
Get full text

Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better by Bennakhi, Ahmad, Byrd, Gregory T., Franzon, Paul

“…This paper aims to outline the effectiveness of modern universal gate quantum computers when utilizing different configurations to solve the B-SAT (Boolean…”
Get full text

SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets by Luo, Weilin, Wei, Ou, Wan, Hai

“…Fault tree analysis (FTA) is a prominent reliability analysis method, which is widely used in safety-critical industries. Computing the minimal cut sets (MCSs)…”
Get full text

Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient by Yamashita, Hiroshi, Aihara, Kazuyuki, Suzuki, Hideyuki

“…•A numerical simulation algorithm for analog Boolean satisfiability solver is proposed.•The proposed method uses the discrete gradient for fast and stable…”
Get full text

Timescales of Boolean satisfiability solver using continuous-time dynamical system by Yamashita, Hiroshi, Aihara, Kazuyuki, Suzuki, Hideyuki

“…•The effect of relative timescale of two parts of the continuous-time dynamical system solver for Boolean satisfiability problem is studied.•A time measure for…”
Get full text

Flexible scheduling of diagnostic tests in automotive manufacturing by König, Simone, Reihn, Maximilian, Abujamra, Felipe Gelinski, Novy, Alexander, Vogel-Heuser, Birgit

“…The car of the future will be driven by software and offer a variety of customisation options. Enabling these customisation options forces modern automotive…”
Get full text

Real-Time Resource Allocation in Passive Optical Network for Energy-Efficient Inference at GPU-Based Network Edge by Nakayama, Yu, Onodera, Yukito, Nguyen, Anh Hoang Ngoc, Hara-Azumi, Yuko

“…In recent years, the advances in deep learning (DL) technology have greatly improved artificial intelligence (AI)-related research and services. Among them,…”
Get full text

Solving the K-subset summation problem based on twice quantum searching by YE Tianyu, WU Heng, GAN Zhigang

“…An efficient quantum algorithm based on twice quantum searching was proposed to solve the K-subset summation problem. In the first quantum searching, a varied…”
Get full text

Polylinear Transformation Method for Solving Systems of Logical Equations by Barotov, Dostonjon Numonjonovich, Barotov, Ruziboy Numonjonovich

“…In connection with applications, the solution of a system of logical equations plays an important role in computational mathematics and in many other areas. As…”
Get full text

SAT-GATv2: A Dynamic Attention-Based Graph Neural Network for Solving Boolean Satisfiability Problem by Chang, Wenjing, Liu, Wenlong

“…We propose SAT-GATv2, a graph neural network (GNN)-based model designed to solve the Boolean satisfiability problem (SAT) through graph-based deep learning…”
Get full text

Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks by Muñoz, Stalin, Carrillo, Miguel, Azpeitia, Eugenio, Rosenblueth, David A.

“…Boolean networks are important models of biochemical systems, located at the high end of the abstraction spectrum. A number of Boolean gene networks have been…”
Get full text

Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework by Chang, Wenjing, Guo, Mengyu, Luo, Junwei

“…The Boolean satisfiability (SAT) problem exhibits different structural features in various domains. Neural network models can be used as more generalized…”
Get full text

Transformation Method for Solving System of Boolean Algebraic Equations by Barotov, Dostonjon, Osipov, Aleksey, Korchagin, Sergey, Pleshakova, Ekaterina, Muzafarov, Dilshod, Barotov, Ruziboy, Serdechnyy, Denis

“…In recent years, various methods and directions for solving a system of Boolean algebraic equations have been invented, and now they are being very actively…”
Get full text

Adaptive real-time reconfiguration gate scheduling scheme using time perceptive stream by Lekashri, S., Madhusudhan, K. N., SivaSangari, A., Gururama Senthilvel, P.

“…An adaptive real-time gate scheduling scheme for time perceptive stream or packet flow is proposed to improve the standards of Ultra Low Latency during data…”
Get full text

Efficient Monte Carlo simulation via the generalized splitting method by Botev, Zdravko I., Kroese, Dirk P.

“…We describe a new Monte Carlo algorithm for the consistent and unbiased estimation of multidimensional integrals and the efficient sampling from…”
Get full text

Computation of minimal unsatisfiable subformulas for SAT-based digital circuit error diagnosis by Gaber, Lamya, Hussein, Aziza I., Mahmoud, Hanafy, Mabrook, M. Mourad, Moness, Mohammed

“…The explanation of infeasibilities formed in Minimal Unsatisfiable Subformulas (MUSes) is a core task in the analysis of over-constrained Boolean formulas. A…”
Get full text