Results 11 to 20 of about 244,612 (315)
A Probabilistic Analysis of Causation [PDF]
The British Journal for the Philosophy of Science, 2011 The starting point in the development of probabilistic analyses of token causation has usually been the naive intuition that, in some relevant sense, a cause raises the probability of its effect. But there are well-known examples both of non-probability-raising causation and of probability-raising non-causation.
Glynn, Luke, Luke Glynn, Glynn, L
openaire +5 more sources
Analysis of Probabilistic Contract Signing [PDF]
, 2003 <p>We present three case studies, investigating the use of probabilistic model checking to automatically analyse properties of probabilistic contract signing protocols. We use the probabilistic model checker PRISM to analyse three protocols: Rabin's probabilistic protocol for fair commitment exchange; the probabilistic contract signing protocol ...
Norman, G., Shmatikov, V.
openaire +3 more sources
Seismic Reliability-Based Design Versus Safety-Factor Based Design of Shallow Foundations Near a slope [PDF]
Numerical Methods in Civil Engineering, 2022 In this study, the stability of the foundation near a slope is investigated through a typical example of designing a shallow foundation. Foundation stability is typically evaluated through the bearing capacity’s factor of safety and the reliability of ...
Ali Shojaeian +2 more
doaj +1 more source
Probabilistic Progressive Collapse Analysis of 3D Steel Moment Frame Using Fragility Curves [PDF]
مهندسی عمران شریف, 2022 Previous studies indicate that low-rise buildings are more prone to progressive collapse rather than high-rise ones. In this research, an innovative method of probabilistic analysis of progressive collapse has been applied based on the concept of ...
E. Mohammadi Dehcheshmeh +2 more
doaj +1 more source
Probabilistic archetypal analysis [PDF]
Machine Learning, 2015 Archetypal analysis represents a set of observations as convex combinations of pure patterns, or archetypes. The original geometric formulation of finding archetypes by approximating the convex hull of the observations assumes them to be real valued. This, unfortunately, is not compatible with many practical situations.
Eugster Manuel, Seth Sohan
openaire +7 more sources
Probabilistic analysis of the complexity of A∗ [PDF]
Artificial Intelligence, 1980 Abstract This paper analyzes the number of nodes expanded by A∗ as a function of the accuracy of its heuristic estimates by treating the errors h∗ - h as random variables whose distributions may vary over the nodes in the graph. Our model consists of an m-ary tree with unit branch costs and a unique goal state situated at a distance N ...
Nam Huyn, Rina Dechter, Judea Pearl
openaire +2 more sources
Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 In this paper, we consider the problem of scheduling independent parallel tasks in parallel systems with identical processors. The problem is NP-hard, since it includes the bin packing problem as a special case when all tasks have unit execution time. We
Keqin Li
doaj +1 more source
Analysis of a probabilistic approach for modelling and assessment of the water quality of rivers
Journal of Hydroinformatics, 2022 Monitoring the ecological status of water bodies is crucial to guarantee human health and economic development. However, monitoring is often deficient in developing regions due to high installation and maintenance costs, thus it is frequently supported ...
Marianne Brum +3 more
doaj +1 more source
A Priority Queue with Many Customer Types, Correlated Arrivals and Changing Priorities
Mathematics, 2020 A single-server queueing system with a finite buffer, several types of impatient customers, and non-preemptive priorities is analyzed. The initial priority of a customer can increase during its waiting time in the queue.
Seokjun Lee +4 more
doaj +1 more source
Probabilistic Analysis of Carlitz Compositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 Using generating functions and limit theorems, we obtain a stochastic description of Carlitz compositions of large integer n (i.e. compositions two successive parts of which are different). We analyze: the number M of parts, the number of compositions T(m,n) with m parts, the distribution of the last part size, the correlation between two successive ...
Guy Louchard, Helmut Prodinger
openaire +6 more sources