A statistical analysis of probabilistic counting algorithms [PDF]
Abstract. This article considers the problem of cardinality estimation in data stream applications. We present a statistical analysis of probabilistic counting algorithms, focusing on two techniques that use pseudo‐random variates to form low‐dimensional data sketches.
Peter Clifford, Ioana A. Cosma
openalex +4 more sources
Machine-learning ensembled probabilistic methods for time-dependent reliability analysis of reservoir slopes under rapid water level drawdown using Bayesian model averaging (BMA) [PDF]
Probabilistic reservoir slope stability analysis usually suffers from computational inefficiency of complicated implicit performance functions. To address this problem, numerous machine learning (ML) algorithms have been successfully applied to calculate
Zehang Li +4 more
doaj +2 more sources
A probabilistic analysis of some tree algorithms [PDF]
In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to the usual complex analysis techniques.
Hanène Mohamed, Philippe Robert
+8 more sources
Probabilistic Non-asymptotic Analysis of Distributed Algorithms [PDF]
We present a new probabilistic analysis of distributed algorithms. Our approach relies on the theory of quasi-stationary distributions (QSD) recently developped by Champagnat and Villemonais. We give properties on the deadlock time and the distribution of the model before deadlock, both for discrete and diffusion models.
Nicolas Champagnat +2 more
openalex +4 more sources
A novel hybrid model for species distribution prediction using probabilistic random forest, principal component analysis and genetic algorithm. [PDF]
Adekunle TA, Ogundoyin IK, Akanbi CO.
europepmc +3 more sources
Probabilistic analysis of Online Bin Coloring algorithms via stochastic comparison [PDF]
This paper proposes a new method for probabilistic analysis of online algorithms. It is based on the notion of stochastic dominance. We develop the method for the online bin coloring problem introduced in [15]. Using methods for the stochastic comparison of Markov chains we establish the result that the performance of the online algorithm $\textsc ...
Benjamin Hiller, Tjark Vredeveld
openalex +4 more sources
A Probabilistic Analysis of the Nxt Forging Algorithm
We discuss the forging algorithm of Nxt from a probabilistic point of view, and obtain explicit formulas and estimates for several important quantities, such as the probability that an account generates a block, the length of the longest sequence of consecutive blocks generated by one account, and the probability that one concurrent blockchain wins ...
Serguei Popov
openalex +4 more sources
Modeling the behavior of a mobile robot using genetic algorithms in harsh ecological environment [PDF]
The article is devoted to the analysis of the behavior of a mobile robot using finite state machine algorithms in order to find a path to a goal and avoid obstacles.
Zarevich Artem +3 more
doaj +1 more source
Probabilistic performance assessment of seismically excited buildings with semi-active fluid viscous dampers [PDF]
This paper presents a procedure to assess the probabilistic performance of the semi-active fluid viscous dampers (SAFVDs) utilized in seismically excited buildings. Some efficient on-off semi-active control algorithms based on motion towards or away from
Ali Asghar Naderi +2 more
doaj +1 more source
Lattice reduction in two dimensions: analyses under realistic probabilistic models [PDF]
The Gaussian algorithm for lattice reduction in dimension 2 is precisely analysed under a class of realistic probabilistic models, which are of interest when applying the Gauss algorithm "inside'' the LLL algorithm.
Brigitte Vallée, Antonio Vera
doaj +1 more source

