Results 211 to 220 of about 1,522 (259)

RRAM Variability Harvesting for CIM‐Integrated TRNG

open access: yesAdvanced Electronic Materials, EarlyView.
This work demonstrates a compute‐in‐memory‐compatible true random number generator that harvests intrinsic cycle‐to‐cycle variability from a 1T1R RRAM array. Parallel entropy extraction enables high‐throughput bit generation without dedicated circuits. This approach achieves NIST‐compliant randomness and low per‐bit energy, offering a scalable hardware
Ankit Bende   +4 more
wiley   +1 more source

On Weighted Configuration Logics

Lecture Notes in Computer Science, 2017
We introduce and investigate a weighted propositional configuration logic over a commutative semiring. Our logic, which is proved to be sound and complete, is intended to serve as a specification language for software architectures with quantitative features.
Paulina Paraponiari   +2 more
exaly   +3 more sources

Weighted Logics for Unranked Tree Automata

Theory of Computing Systems, 2009
Generalizing similar work on weighted string and tree languages, on the one hand, and work on unranked tree languages, on the other hand, the authors introduce weighted tree automata and a weighted monadic second-order (MSO) logic for unranked trees (i.e., trees in which a node labeled by a given symbol may have any number of children).
Heiko Vogler   +2 more
exaly   +2 more sources

Home - About - Disclaimer - Privacy