Results 141 to 150 of about 770 (181)

Concept, development and applications of DNA computation. [PDF]

Fundam Res
Zhang M, Han D.
europepmc   +1 more source

Two-Phase Distributed Genetic-Based Algorithm for Time-Aware Shaper Scheduling in Industrial Sensor Networks. [PDF]

Sensors (Basel)
Chang RI, Hsu TW, Chen YT.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Stochastic Boolean Satisfiability

Journal of Automated Reasoning, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael L. Littman, Stephen M. Majercik, Toniann Pitassi   +2 more
openaire   +2 more sources

Connectivity of Boolean satisfiability [PDF]

, 2016
[no abstract]
openaire   +1 more source

Boolean satisfiability for sequence mining

Proceedings of the 22nd ACM international conference on Information & Knowledge Management, 2013
In this paper, we propose a SAT-based encoding for the problem of discovering frequent, closed and maximal patterns in a sequence of items and a sequence of itemsets. Our encoding can be seen as an improvement of the approach proposed in [8] for the sequences of items.
Saïd Jabbour, Lakhdar Sais, Yakoub Salhi   +2 more
openaire   +1 more source

Boolean satisfiability on a graphics processor

Proceedings of the 20th symposium on Great lakes symposium on VLSI, 2010
Boolean Satisfiability (SAT) is a core NP-complete problem. Several heuristic software and hardware approaches have been proposed to solve this problem. In this paper we present a Boolean satisfiablity approach with a new GPU-enhanced variable ordering heuristic.
Kanupriya Gulati, Sunil P. Khatri
openaire   +1 more source

On Probabilistic Generalization of Backdoors in Boolean Satisfiability

Proceedings of the AAAI Conference on Artificial Intelligence, 2022
The paper proposes a probabilistic generalization of the well-known Strong Backdoor Set (SBS) concept applied to the Boolean Satisfiability Problem (SAT). We call a set of Boolean variables B a ρ-backdoor, if for a fraction of at least ρ of possible assignments of variables from B, assigning their values to variables in a Boolean formula in Conjunctive
Alexander A. Semenov, Artem Pavlenko, Daniil Chivilikhin, Stepan Kochemazov   +3 more
openaire   +1 more source

Exact diagnosis using boolean satisfiability

Proceedings of the 35th International Conference on Computer-Aided Design, 2016
We propose an exact algorithm to model-free diagnosis with an application to fault localization in digital circuits. We assume that a faulty circuit and a correctness specification, e.g., in terms of an un-optimized reference circuit, are available.
Heinz Riener, Görschwin Fey
openaire   +1 more source

Applying UCT to Boolean Satisfiability

2011
In this paper we perform a preliminary investigation into the application of sampling-based search algorithms to satisfiability testing of propositional formulas in Conjunctive Normal Form (CNF). In particular, we adapt the Upper Confidence bounds applied to Trees (UCT) algorithm [5] which has been successfully used in many game playing programs ...
Alessandro Previti, Raghuram Ramanujan, SCHAERF, Marco, Bart Selman   +3 more
openaire   +2 more sources

Resolution for Stochastic Boolean Satisfiability

2010
The stochastic Boolean satisfiability (SSAT) problem was introduced by Papadimitriou in 1985 by adding a probabilistic model of uncertainty to propositional satisfiability through randomized quantification. SSAT has many applications, e.g., in probabilistic planning and, more recently by integrating arithmetic, in probabilistic model checking.
Tino Teige, Martin Fränzle
openaire   +1 more source