Results 31 to 40 of about 9,542 (233)
InformatikaObjectives. The problems of minimizing the number of cofactors (subfunctions) of the Shannon expansions located at the same level of the BDD, representing a system of incompletely defined (partial) Boolean functions, are considered.
P. N. Bibilo
doaj +1 more source
Advanced Functional Materials, EarlyView.Tin hexathiophosphate memristors leverage intrinsic nanopores together with a guided filament formation strategy to regulate titanium ion motion and switching behavior. The devices support reliable nonvolatile memory and reconfigurable logic‐in‐memory, demonstrating 14 Boolean logic functions in a single cell.
Thaw Tint Te Tun +7 more
wiley +1 more source
A method for bi-decomposition of partial Boolean functions
Informatika, 2019 The problem of bi-decomposition of a Boolean function is to represent a given Boolean function in the form of a given logic algebra operation over two Boolean functions and so is reduced to specification of these functions.
Yu. V. Pottosin
doaj
Efficient quantum algorithms for set operations
Scientific ReportsAnalyzing the relations between Boolean functions has many applications in many fields, such as database systems, cryptography, and collision problems. This paper proposes four quantum algorithms that use amplitude amplification techniques to perform set
Rehab Elgendy +3 more
doaj +1 more source
Light‐Programmable Interfaces: From Molecular Photoswitching to Adaptive Membrane Separations
Advanced Materials Interfaces, EarlyView.This review advances an interface‐centered framework for light‐responsive membranes, linking molecular photoswitches (azobenzene (AZO), spiropyran (SP), diarylethene (DAE), donor–acceptor Stenhouse adducts (DASA), photoacid) to integration strategies in polymeric, porous, self‐assembled, and mixed‐matrix systems.
Liangliang Zhang +6 more
wiley +1 more source
A METHOD FOR BI-DECOMPOSITION OF PARTIAL BOOLEAN FUNCTIONS
Prikladnaya Diskretnaya Matematika, 2020 Summary: A method for bi-decomposition of incompletely specified (partial) Boolean functions is suggested. The problem of bi-decomposition is reduced to the problem of two-block weighted covering a set of edges of a graph of rows orthogonality of a ternary or binary matrix that specify a given function, by complete bipartite subgraphs (bicliques). Each
openaire +3 more sources
Scalable Task Planning via Large Language Models and Structured World Representations
Advanced Robotics Research, EarlyView.This work efficiently combines graph‐based world representations with the commonsense knowledge in Large Language Models to enhance planning techniques for the large‐scale environments that modern robots will need to face. Planning methods often struggle with computational intractability when solving task‐level problems in large‐scale environments ...
Rodrigo Pérez‐Dattari +4 more
wiley +1 more source
Stable Imitation of Multigait and Bipedal Motions for Quadrupedal Robots Over Uneven Terrains
Advanced Robotics Research, EarlyView.How are quadrupedal robots empowered to execute complex navigation tasks, including multigait and bipedal motions? Challenges in stability and real‐world adaptation persist, especially with uneven terrains and disturbances. This article presents an imitation learning framework that enhances adaptability and robustness by incorporating long short‐term ...
Erdong Xiao +3 more
wiley +1 more source
Generalized Semi-bent and Partially Bent Boolean Functions [PDF]
Mathematical Sciences Letters, 2014 In this article, a relationship between the Walsh-Hadamard spectrum and σ f , the sum-of-squares-modulus indicator (SSMI) of the generalized Boolean function is presented. It is demonstrated for every s-plateaued generalized Boolean function in n variables that σ f = 2 2n+s . Two constructions on generalized semi-bent Boolean functions are presented. A
openaire +1 more source
Variations on extending partially defined Boolean functions with missing bits
Information and Computation, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boros, Endre +2 more
openaire +1 more source