Results 31 to 40 of about 1,307,610 (290)
Bounding Failure Probability with the SIVIA Algorithm [PDF]
Book of Extended Abstracts for the 32nd European Safety and Reliability Conference, 2022 The accuracy of Monte Carlo simulation methods depends on the computational effort invested in reducing the estimator variance. Typically reducing such variance requires invoking Monte Carlo with as many samples as one can afford. When the system is complex and the failure event is rare, it can be challenging to establish the correctness of the failure
de Angelis, Marco, Gray, Ander
openaire +4 more sources
Election algorithms with random delays in trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The election is a classical problem in distributed algorithmic. It aims to design and to analyze a distributed algorithm choosing a node in a graph, here, in a tree. In this paper, a class of randomized algorithms for the election is studied.
Jean-François Marckert +2 more
doaj +1 more source
Algorithmic Randomness and Capacity of Closed Sets [PDF]
Logical Methods in Computer Science, 2011 We investigate the connection between measure, capacity and algorithmic randomness for the space of closed sets. For any computable measure m, a computable capacity T may be defined by letting T(Q) be the measure of the family of closed sets K which have
Douglas Cenzer +3 more
doaj +1 more source
Engineering Proceedings, 2023 This paper is devoted to the evaluation of the hardware resources of computer systems for solving a computationally expensive problem such as the calculation of the probability distributions of statistics by the second multiplicity method based on Δ ...
Andrey Melnikov +3 more
doaj +1 more source
The Discovery of Algorithmic Probability
Journal of Computer and System Sciences, 1997 This paper will describe a voyage of discovery — the discovery of Algorithmic Probability. But before I describe that voyage —a few words about motivation. Motivation in science is roughly of two kinds: In one, the motivation is discovery itself — the joy of “going where no one has gone before” — the excitement of creating new universes and exploring ...
openaire +2 more sources
Performance Study of a Class of Irregular Near Capacity Achieving LDPC Codes
Journal of Communications Software and Systems, 2021 This paper investigates the performance of a class of irregular low-density parity-check (LDPC) codes through a recently published low complexity upper bound on their beliefpropagation decoding thresholds.
Francesca Vatta +4 more
doaj +1 more source
Exploring Simplicity Bias in 1D Dynamical Systems
EntropyArguments inspired by algorithmic information theory predict an inverse relation between the probability and complexity of output patterns in a wide range of input–output maps. This phenomenon is known as simplicity bias.
Kamal Dingle +3 more
doaj +1 more source
Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines. [PDF]
PLoS ONE, 2014 Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings.
Fernando Soler-Toscano +3 more
doaj +1 more source
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
FEBS Letters, EarlyView.EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
An Algorithmic Approach to Information and Meaning [PDF]
, 2011 While it is legitimate to study ideas and concepts related to information in their broadest sense, that formal approaches properly belong in specific contexts is a fact that is too often ignored. That their use outside these contexts amounts to misuse or
Zenil, Hector
core