Výsledky vyhledávání - (("boolean satisfiability problem") OR ("boolean satisfiability problems"))

Quantum Optimization with Arbitrary Connectivity Using Rydberg Atom Arrays Autor 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…”
Získat plný text

Solving the K-subset summation problem based on twice quantum searching Autor 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…”
Získat plný text

Accurate Modeling of Continuous-time SAT Solvers in SPICE Autor 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…”
Získat plný text

Parallel SAT framework to find clustering of differential characteristics and its applications Autor 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…”
Získat plný text

Improving probability selection based weights for satisfiability problems Autor 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…”
Získat plný text

Intractability of Optimal Multirobot Path Planning on Planar Graphs Autor Yu, Jingjin

“…We study the computational complexity of optimally solving multirobot path planning problems on planar graphs. For four common time- and distance-based…”
Získat plný text

基于Grover算法的图着色问题求解 Autor 刘晓楠, 刘正煜, 谢浩山, 赵晨言

“…TP385; Grover量子搜索算法是针对非结构化搜索问题设计的著名量子算法,可用于解决图着色、最短路径排序等问题,也可以有效破译密码系统.图着色问题是最著名的NP-完全问题之…”
Získat plný text

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

“…Context-sensitive fusion grammars and fusion grammars with forbidden context are special cases of context-dependent fusion grammars where instead of finite…”
Získat plný text

Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better Autor 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…”
Získat plný text

SATMCS: An Efficient SAT-Based Algorithm and Its Improvements for Computing Minimal Cut Sets Autor 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)…”
Získat plný text

Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient Autor 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…”
Získat plný text

Timescales of Boolean satisfiability solver using continuous-time dynamical system Autor 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…”
Získat plný text

Flexible scheduling of diagnostic tests in automotive manufacturing Autor 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…”
Získat plný text

Real-Time Resource Allocation in Passive Optical Network for Energy-Efficient Inference at GPU-Based Network Edge Autor 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,…”
Získat plný text

Polylinear Transformation Method for Solving Systems of Logical Equations Autor 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…”
Získat plný text

SAT-GATv2: A Dynamic Attention-Based Graph Neural Network for Solving Boolean Satisfiability Problem Autor 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…”
Získat plný text

Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks Autor 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…”
Získat plný text

Predicting the satisfiability of Boolean formulas by incorporating gated recurrent unit (GRU) in the Transformer framework Autor 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…”
Získat plný text

Transformation Method for Solving System of Boolean Algebraic Equations Autor 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…”
Získat plný text

Adaptive real-time reconfiguration gate scheduling scheme using time perceptive stream Autor 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…”
Získat plný text