Results 241 to 250 of about 128,927 (292)

Mining Frequent Boolean Expressions

International Journal of Knowledge Discovery in Bioinformatics, 2010
Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean expressions from data sources. In this paper, the authors introduce a novel framework called BLOSOM for mining (frequent) boolean expressions over binary-valued datasets.
Mohammed J. Zaki, Naren Ramakrishnan, Lizhuang Zhao   +2 more
openaire   +1 more source

Generating Boolean $\mu$ -expressions

Acta Informatica, 1995
We consider the class of Boolean \(\mu\)-functions, which are the Boolean functions definable by \(\mu\)-expressions (Boolean expressions in which no variable occurs more than once). We present an algorithm which transforms a Boolean formula \(E\) into an equivalent \(\mu\)-expression -- if possible -- in time linear in \(\| E \|\) times \(2^{n_ m ...
openaire   +2 more sources

Optimization of Boolean Expressions-Historical Developments

IEEE Annals of the History of Computing, 1980
Boolean expressions play an essential role in all aspects of computer science. Interest in them is rooted in compiler design. Clearly, every compiler must be designed to evaluate Boolean expressions. It is therefore essential that the compiled code be as efficient as possible.
Minker, Jack, Minker, Rita G.
openaire   +1 more source

Efficient Parallel Evaluation of Boolean Expressions

IEEE Transactions on Computers, 1976
A Boolean expression wilth n literals, i.e., n distinct appearances of variables, can be evaluated by a parallel processing system in at most 1.81 log2n steps, or, equivalently, by a network constructed with two-input AND and OR gates and having at most 1.81 log2n levels.
Preparata, Franco P., Muller, David E.
openaire   +1 more source

Boolean expression extender — A mutation operator for strengthening and weakening boolean expressions

2017 XLIII Latin American Computer Conference (CLEI), 2017
The degree in which a software system is guaranteed to correctly provide its intended functionality, is one of the most relevant properties in the development of quality software, and the concern of software verification. Among the many techniques that approach software verification, testing, i.e., contrasting actual software behavior against expected ...
Simon Gutierrez Brida, Gaston Scilingo
openaire   +1 more source

Generating Optimal Plans for Boolean Expressions

2018 IEEE 34th International Conference on Data Engineering (ICDE), 2018
We present an algorithm that produces optimal plans to evaluate arbitrary Boolean expressions possibly containing conjunctions and disjunctions. The complexity of our algorithm is O(n3n), where n is the number of simple predicates in the Boolean expression. This complexity is far lower than that of Reinwald and Soland's algorithm (O(22n)).
Kastrati, Fisnik, Moerkotte, Guido
openaire   +2 more sources

Boolean Expressions and Conditionals

1998
In the previous chapter we showed how to reason about predicates and sets in general. In programming, predicates arise in two different disguises. First, they are used to describe control structures with branching, like conditional statements and loops. Second, they are used to express correctness conditions for programs.
Ralph-Johan Back, Joakim Wright
openaire   +1 more source

Boolean expression of LUM smoothers

IEEE Signal Processing Letters, 2001
A new algorithm for rank order-based nonlinear lower-upper-middle (LUM) smoothers, setting out from the threshold decomposition and the stacking property is described. The novelty of this approach lies in generating minimal positive Boolean functions through permutation coloring of binary signals with dependency on the control parameter of the LUM ...
R. Lukac, S. Marchevsky
openaire   +1 more source

On translation of Boolean expressions

Communications of the ACM, 1962
A program which translates an algorithmic language such as ALGOL into the machine language of an electronic computer performs the following functions: Analysis .
Bottenbruch, H. H., Grau, A. A.
openaire   +1 more source

Test generation for Boolean expressions

Proceedings of Sixth International Symposium on Software Reliability Engineering. ISSRE'95, 2002
We propose a new strategy for generating test cases for Boolean expressions. In the past, we reported the BOR (Boolean Operator) strategy for generating test cases for predicates which are singular: which contain only one occurrence of each constituent Boolean variable.
A. Paradkar, K.C. Tai
openaire   +1 more source