Results 251 to 260 of about 2,257,648 (287)
Some of the next articles are maybe not open access.
1975
Abstract : A model for random search is considered which differs from the classical random search by modeling the random paths of the searcher and/or target as those of a Wiener process. The quantity of interest is the distribution of detection time for a cookie cutter mode of detection. Only one- dimensional search is considered here.
openaire +1 more source
Abstract : A model for random search is considered which differs from the classical random search by modeling the random paths of the searcher and/or target as those of a Wiener process. The quantity of interest is the distribution of detection time for a cookie cutter mode of detection. Only one- dimensional search is considered here.
openaire +1 more source
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
Artificial bee colony based on adaptive search strategy and random grouping mechanism
Expert Systems With Applications, 2022Tao Zeng, Wenjun Wang, Hui Wang
exaly
Random projection-based auxiliary information can improve tree-based nearest neighbor search
Information Sciences, 2021Kaushik Sinha
exaly
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
Soil Erosion Status Prediction Using a Novel Random Forest Model Optimized by Random Search Method
Sustainability, 2023Zahraa Tarek +2 more
exaly
Continuous functions minimization by dynamic random search technique
Applied Mathematical Modelling, 2007Coşkun HamzaÇebİ
exaly