Results 231 to 240 of about 539,396 (266)
Some of the next articles are maybe not open access.
2020
An important subclass is formed by those methods whose mutation transition probabilities pn have Lebesgue densities.
openaire +1 more source
An important subclass is formed by those methods whose mutation transition probabilities pn have Lebesgue densities.
openaire +1 more source
Random Multivariate Search Trees
2006Trees are commonly used to store data so that they can be efficiently retrieved and used in applications. For multidimensional data, one could consider kd-trees, quadtrees, BSP trees, simplex trees, grid trees, epsilon nets, and many other structures. The height of these trees is logarithmic in the data size for random input.
openaire +1 more source
2019
We use dynamics of measures, i.e. iteration of the operators from measurable space to space of probabilistic measures on this space, to model and prove properties of random search algorithms. Specifically using this technique in the context of Game Theory we show that stochastic better response dynamics, where players in the potential game perform ...
openaire +1 more source
We use dynamics of measures, i.e. iteration of the operators from measurable space to space of probabilistic measures on this space, to model and prove properties of random search algorithms. Specifically using this technique in the context of Game Theory we show that stochastic better response dynamics, where players in the potential game perform ...
openaire +1 more source
Computational advantage of quantum random sampling
Reviews of Modern Physics, 2023Dominik Hangleiter, Jens Eisert
exaly
Efficient Generation of Transcriptomic Profiles by Random Composite Measurements
Cell, 2017Brian Cleary, Le Cong, Eric S Lander
exaly