Results 221 to 230 of about 558,564 (263)
Some of the next articles are maybe not open access.
Search for the maximum of a random walk
Random Structures & Algorithms, 1992AbstractThis paper examines the efficiency of various strategies for searching in an unknown environment. The model is that of the simple random walk, which can be taken as a representation of a function with a bounded derivative that is difficult to compute. Let X1, X2+,. be independent and identically distributed with Prob(Xj = 1) = Prob(Xj = ‐1) = 1/
openaire +2 more sources
Randomized binary search trees
Journal of the ACM, 1998In this paper, we present randomized algorithms over binary search trees such that: (a) the insertion of a set of keys, in any fixed order, into an initially empty tree always produces a random binary search tree; (b) the deletion of any key from a random binary search tree results in a random binary search tree; (c) the random choices ...
Conrado Martínez, Salvador Roura
openaire +1 more source
Randomized binary search technique
Communications of the ACM, 1969A mathematical model is developed for the mean and variance of the number of trials to recover a given document in a randomly received list of files. The search method described is binary in nature and offers new potential for information retrieval systems.
S. R. Arora, W. T. Dent
openaire +2 more sources
Searching for Patterns in Random Sequences.
Canadian Journal of Experimental Psychology / Revue canadienne de psychologie expérimentale, 2004In a probability-guessing paradigm, participants predict which of two events will occur on each trial. Participants generally frequency match even though frequency matching is nonoptimal with random sequences. The optimal strategy is to guess the most frequent event, maximizing. We hypothesize that frequency matching results from a search for patterns,
George, Wolford +3 more
openaire +2 more sources
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
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
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.
Ralph Neininger, Luc Devroye
exaly +3 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