Results 21 to 30 of about 2,300,412 (294)
Approximate Quantifier Elimination for Propositional Boolean Formulae [PDF]
, 2011 This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula.
Lijun Zhang +9 more
core +1 more source
Significant Secret Image Sharing Scheme Based on Boolean Operation
Cybernetics and Information Technologies, 2017 Traditionally, (k, n) secret image sharing is an approach of breaking down a secret image into n number of shadow images to assign them to n number of users, so that any k or more then k users can bring back the secret image.
Verma Monu, Rani Rajneesh
doaj +1 more source
Discernibility Matrix and Its Application in Logical Optimization
Jisuanji kexue yu tansuo, 2021 The simplification of truth table is of great significance to the analysis and design of logic circuits. In this paper, the simplification of truth table is studied, and a method of GDM (granular discernibility matrix) that uses discernibility matrix is ...
YAN Xinyi, WEN Xin, CHEN Zehua
doaj +1 more source
ACM Transactions on Graphics, 2022 We port Boolean set operations between 2D shapes to surfaces of any genus, with any number of open boundaries. We combine shapes bounded by sets of freely intersecting loops, consisting of geodesic lines and cubic Bézier splines lying on a surface. We compute the arrangement of shapes directly on the surface and assign integer labels to the cells of ...
Riso M. +5 more
openaire +1 more source
Memristive Stateful Logic for Edge Boolean Computers
Advanced Intelligent Systems, 2021 Memristive stateful logic enables complete in‐memory computing, allowing low‐power and low‐cost Boolean computing. Its characteristics are consistent with the requirements of edge computing devices, which will occupy a considerable segment in the coming ...
Young Seok Kim +2 more
doaj +1 more source
A heuristic method for bi-decomposition of partial Boolean functions
Informatika, 2020 The problem of decomposition of a Boolean function is to represent a given Boolean function in the form of a superposition of some Boolean functions whose number of arguments are less than the number of given function.
Yu. V. Pottosin
doaj +1 more source
Secret Image Sharing Scheme Based on a Boolean Operation
Cybernetics and Information Technologies, 2014 Traditionally extensive researches have been done on secret image sharing which support the fault tolerance property. But their reconstruction complexity is high. Some research papers on secret image sharing are also available with smaller reconstruction
Nag Amitava +3 more
doaj +1 more source
Evolving sensitivity balances Boolean networks [PDF]
, 2012 We investigate the sensitivity of Boolean Networks (BNs) to mutations. We are interested in Boolean Networks as a model of Gene Regulatory Networks (GRNs). We adopt Ribeiro and Kauffman’s Ergodic Set and use it to study the long term dynamics of a BN. We
Turner, Matthew S. +9 more
core +2 more sources
Idealising mesh modelling for haptic enabled services and operands [PDF]
, 2013 Communicating the knowledge and science of product engineering, analysis and manufacturing planning is an area of continued research driven by the digital economy.
Arnez, Victor +7 more
core +4 more sources
Boolean Differential Operators
, 2012 We consider four combinatorial interpretations for the algebra of Boolean differential operators. We show that each interpretation yields an explicit matrix representation for Boolean differential operators.
Catumba, Jorge, Díaz, Rafael
openaire +3 more sources