Results 251 to 260 of about 128,927 (292)
Some of the next articles are maybe not open access.
Efficient evaluation of Boolean expressions
ACM SIGPLAN Notices, 1978An algorithm for the generation of an optimal code applicable to a parsed Boolean expression is presented. The algorithm generates the code during parsing itself.
V. Sinha, K. Vinod Kumar
openaire +1 more source
Inhibited expressions of Boolean differences
International Journal of Electronics, 1980The values of simple and double Boolean differences arc deduced from the coefficients of the factorized logical function. The differences are written in the form of inhibited terms in order to facilitate the choice of teats set for the detection of s-a-0 and s-a-l faults.
Z. M. LOTFI, A. J. TOSSER
openaire +1 more source
Computer expansion of Boolean expressions
Proceedings of the June 1971 design automation workshop on Design automation - DAC '71, 1971A computer oriented algorithm for symbolically expanding Boolean expressions containing “and”, “or”, and “complement” operators into their disjuntive normal form is presented. The algorithm consists of two parts in sequence. The first part applies the DeMorgan's laws, and the second part applies the distributive laws.
Y. H. Chuang, C. C. Kao
openaire +1 more source
Arithmetic Boolean Expressions
1996Boolean expressions are sometimes used in the research and development of digital systems, but calculating Boolean expressions by hand is a cumbersome job, even when they have only a few variables. For example, the Boolean expressions \(\left( {a \wedge \bar{b}} \right) \vee \left( {\bar{a} \wedge \bar{c}} \right) \vee \left( {b \wedge c} \right),\left(
openaire +1 more source
Random Boolean functions induced by random Boolean expressions
2016We consider a set of Boolean expressions with a probability measure on it and call this our model. This model induces a probability measure on the Boolean functions. The induced probability depends strongly on the underlying Boolean expressions, so we consider several different sets of Boolean expressions, i.e.
openaire +1 more source
Ordered Boolean List (OBL): Reducing the Footprint for Evaluating Boolean Expressions
IEEE Transactions on Visualization and Computer Graphics, 2011An Expanded Boolean Expression (EBE) does not contain any XOR or EQUAL operators. The occurrence of each variable is a different literal. We provide a linear time algorithm that converts an EBE of n literals into a logically equivalent Ordered Boolean List (OBL) and show how to use the OBL to evaluate the EBE in n steps and O(log log n) space, if the ...
openaire +2 more sources
Realization of Boolean Expressions by Atomic Digraphs
IEEE Transactions on Computers, 1978A theory relating certain labeled directed graphs and Boolean expressions over propositional variables is seen to have several interesting applcations in computer science, most notably to programming, compiling, and switching theory. The applications arise from the capability of realizing any Boolean expression by a member of the class of digraphs here
Prather, Ronald E. +1 more
openaire +2 more sources
Translating Boolean Expressions
1979It’s possible to treat Boolean expressions in exactly the same way as arithmetic expressions — generate instructions to evaluate the subnodes, generate an instruction (or a sequence of instructions) to combine the Boolean values. Thus Boolean and and Boolean or operations can be translated using the TranBinOp procedure of chapter 5 with the machine ...
openaire +1 more source
On the Parallel Evaluation of Boolean Expressions
SIAM Journal on Computing, 1976A bound for the number of steps that are required to evaluate Boolean expressions is obtained. It is shown that any Boolean expression of n distinct variables may be evaluated in $2\log _2 n - 1$ steps if sufficiently many processors are available.
Barak, Amnon, Shamir, Eliahu
openaire +1 more source
Efficient Parallel Boolean Expression Matching
ACM Transactions on Database SystemsBoolean expression matching plays an important role in many applications. However, existing solutions still show efficiency and scalability limitations. For example, existing solutions often exhibit degraded performance when applied to high-dimensional and diverse workloads, and existing algorithms rarely consider supporting concurrent ...
Shuping Ji +4 more
openaire +1 more source