Results 71 to 80 of about 188,896 (327)

In Materia Shaping of Randomness with a Standard Complementary Metal‐Oxide‐Semiconductor Transistor for Task‐Adaptive Entropy Generation

open access: yesAdvanced Functional Materials, EarlyView.
This study establishes a materials‐driven framework for entropy generation within standard CMOS technology. By electrically rebalancing gate‐oxide traps and Si‐channel defects in foundry‐fabricated FDSOI transistors, the work realizes in‐materia control of temporal correlation – achieving task adaptive entropy optimization for reinforcement learning ...
Been Kwak   +14 more
wiley   +1 more source

Probabilistic computing using Cu0.1Te0.9/HfO2/Pt diffusive memristors

open access: yesNature Communications, 2022
Designing a computing scheme to solve complex tasks as the big data field proliferates remains a challenge. Here, the authors present a probabilistic bit generation hardware built using the random nature of Cu x Te1−x /HfO2/Pt memristors capable of ...
Kyung Seok Woo   +5 more
doaj   +1 more source

Intrinsic Nanopore‐Assisted SnP2S6 Memristors With Ti Ion Dynamics for Compact Logic‐In‐Memory Hardware

open access: yesAdvanced 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

Probabilistic regular graphs [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph ...
Christophe Morvan, Nathalie Bertrand
doaj   +1 more source

Probabilistic logic programming

open access: yesInformation and Computation, 1992
The logic programming language for expressing a probabilistic information is proposed. \(P\)-programs are finite sets of clauses of a special kind: the head of a clause is an atomic formula loaded by a closed interval \([a,b]\), and the body is a set of formulae (not only atomic) which are loaded by closed intervals too. The formula \(F:[a,b]\) denotes
Ng, Raymond, Subrahmanian, V.S.
openaire   +2 more sources

Membrane Fusion‐Inspired Nanomaterials: Emerging Strategies for Infectious Disease and Cancer Diagnostics

open access: yesAdvanced Healthcare Materials, EarlyView.
Membrane fusion‐inspired nanomaterials offer transformative potential in diagnostics by mimicking natural fusion processes to achieve highly sensitive and specific detection of disease biomarkers. This review highlights recent advancements in nanomaterial functionalization strategies, signal amplification systems, and stimuli‐responsive fusion designs,
Sojeong Lee   +9 more
wiley   +1 more source

Model Checking Probabilistic Timed Automata with One or Two Clocks [PDF]

open access: yesLogical Methods in Computer Science, 2008
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic timed automata which have one or two clocks.
Marcin Jurdzinski   +2 more
doaj   +1 more source

Probabilistic Inference Modulo Theories [PDF]

open access: yes, 2016
We present SGDPLL(T), an algorithm that solves (among many other problems) probabilistic inference modulo theories, that is, inference problems over probabilistic models defined via a logic theory provided as a parameter (currently, propositional ...
Braz, Rodrigo de Salvo   +3 more
core   +1 more source

Nonmonotonic Probabilistic Logics between Model-Theoretic Probabilistic Logic and Probabilistic Logic under Coherence

open access: yes, 2002
Recently, it has been shown that probabilistic entailment under coherence is weaker than model-theoretic probabilistic entailment. Moreover, probabilistic entailment under coherence is a generalization of default entailment in System P. In this paper, we continue this line of research by presenting probabilistic generalizations of more sophisticated ...
openaire   +2 more sources

Weak nonmonotonic probabilistic logics

open access: yesArtificial Intelligence, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Home - About - Disclaimer - Privacy