Results 271 to 280 of about 609,466 (311)
Some of the next articles are maybe not open access.
On Random Search for a Global Extremum
Theory of Probability & Its Applications, 1984Translation from Teor. Veroyatn. Primen. 28, No.1, 129-134 (Russian) (1984; Zbl 0524.49025).
Ermakov, S. M., Zhiglyavskij, A. A.
openaire +2 more sources
Menu search: random or systematic?
International Journal of Man-Machine Studies, 1987Abstract This paper questions the conclusion that menu search is random, not systematic. Three sources of evidence—search times per target as a function of target position, eye movement patterns during search, and the cumulative probability of locating a target as a function of time—cited in support of random search (Card, 1982, 1983) are re-examined
James N. MacGregor, Eric S. Lee
openaire +1 more source
Optimizing the success of random searches
Nature, 1999We address the general question of what is the best statistical strategy to adapt in order to search efficiently for randomly located objects ('target sites'). It is often assumed in foraging theory that the flight lengths of a forager have a characteristic scale: from this assumption gaussian, Rayleigh and other classical distributions with well ...
G M, Viswanathan +5 more
openaire +2 more sources
Random Structures & Algorithms, 2003
AbstractA random suffix search tree is a binary search tree constructed for the suffixes Xi = 0 · BiBi+1Bi+2… of a sequence B1, B2, B3, … of independent identically distributed random b‐ary digits Bj. Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on ℤb.
Devroye, Luc, Neininger, Ralph
openaire +1 more source
AbstractA random suffix search tree is a binary search tree constructed for the suffixes Xi = 0 · BiBi+1Bi+2… of a sequence B1, B2, B3, … of independent identically distributed random b‐ary digits Bj. Let Dn denote the depth of the node for Xn in this tree when B1 is uniform on ℤb.
Devroye, Luc, Neininger, Ralph
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
A parallel algorithm for random searches
Computer Physics Communications, 2015Abstract We discuss a parallelization procedure for a two-dimensional random search of a single individual, a typical sequential process. To assure the same features of the sequential random search in the parallel version, we analyze the former spatial patterns of the encountered targets for different search strategies and densities of homogeneously ...
Marina E. Wosniack +3 more
openaire +1 more source
Search in unknown random environments
Physical Review E, 2010N searchers are sent out by a source in order to locate a fixed object which is at a finite distance D, but the search space is infinite and D would be in general unknown. Each of the searchers has a finite random lifetime, and may be subject to destruction or failures, and it moves independently of other searchers, and at intermediate locations some ...
openaire +2 more sources
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics
Algorithmica, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doerr, Carola, Doerr, Benjamin
openaire +3 more sources
Distances and Finger Search in Random Binary Search Trees
SIAM Journal on Computing, 2004Summary: For the random binary search tree with \(n\) nodes inserted the number of ancestors of the elements with ranks \(k\) and \(\ell\), \(1 \leq k < \ell \leq n\), as well as the path distance between these elements in the tree are considered. For both quantities, central limit theorems for appropriately rescaled versions are derived.
Luc Devroye, Ralph Neininger
openaire +2 more sources
Optimal search in random quantizers
Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition,, 2003Signal sample quantization represents the basic operation of any system for digital signal processing and can be mathematically formalized as a least-distance application from the domain of input samples to a finite and fixed set of reproduction values generally called quantization levels, in case of scalar quantization, or reconstruction codewords in ...
openaire +1 more source