Results 31 to 40 of about 128,927 (292)
Efficiently evaluating complex boolean expressions [PDF]
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, 2010 The problem of efficiently evaluating a large collection of complex Boolean expressions - beyond simple conjunctions and Disjunctive/Conjunctive Normal Forms (DNF/CNF) - occurs in many emerging online advertising applications such as advertising exchanges and automatic targeting.
Marcus Fontoura +6 more
openaire +1 more source
Robustness of Transcriptional Regulation in Yeast-like Model Boolean Networks [PDF]
, 2009 We investigate the dynamical properties of the transcriptional regulation of gene expression in the yeast Saccharomyces Cerevisiae within the framework of a synchronously and deterministically updated Boolean network model.
Balcan D. +6 more
core +3 more sources
Generalised and Quotient Models for Random And/Or Trees and Application to Satisfiability
, 2015 This article is motivated by the following satisfiability question: pick uniformly at random an and/or Boolean expression of length n, built on a set of k_n Boolean variables. What is the probability that this expression is satisfiable?
Genitrini, Antoine, Mailler, Cécile
core +2 more sources
ViBEx: A Visualization Tool for Gene Expression Analysis
BioMedInformaticsBackground: Variations in the states of Gene Regulatory Networks significantly influence disease outcomes and drug development. Boolean Networks serve as a tool to conceptualize and understand the complex relationships between genes.
Michael H. Terrefortes-Rosado +3 more
doaj +1 more source
Automatic Repair of Overflowing Expressions with Abstract Interpretation [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We consider the problem of synthesizing provably non-overflowing integer arithmetic expressions or Boolean relations among integer arithmetic expressions.
Francesco Logozzo, Matthieu Martel
doaj +1 more source
The number and probability of canalizing functions
, 2003 Canalizing functions have important applications in physics and biology. For example, they represent a mechanism capable of stabilizing chaotic behavior in Boolean network models of discrete dynamical systems.
Aldana +20 more
core +1 more source
Delay synchronization of temporal Boolean networks
AIP Advances, 2016 This paper investigates the delay synchronization between two temporal Boolean networks base on semi-tensor product method, which improve complete synchronization.
Qiang Wei +4 more
doaj +1 more source
Faster Query Answering in Probabilistic Databases using Read-Once Functions [PDF]
, 2010 A boolean expression is in read-once form if each of its variables appears exactly once. When the variables denote independent events in a probability space, the probability of the event denoted by the whole expression in read-once form can be computed ...
Perduca, Vittorio +2 more
core +2 more sources
Functions Definable by Numerical Set-Expressions
, 2009 A "numerical set-expression" is a term specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. If these operations are confined to the usual Boolean operations together with the result of lifting ...
Düntsch, Ivo, Pratt-Hartmann, Ian
core +1 more source
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests [PDF]
, 2014 We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams (BDD). The key idea
Bouajjani A. +10 more
core +5 more sources