Results 281 to 290 of about 12,241,994 (329)
Some of the next articles are maybe not open access.
Randomizing Reductions of Search Problems
SIAM Journal on Computing, 1993The paper, with a foundational character, provides mathematically sound and robust definitions for the notion of ``feasible solution for a search problem'' and ``many-one randomized reduction'' in the context of the theory of average-case complexity.
Andreas Blass, Yuri Gurevich
openaire +3 more sources
Random search for learning the linear quadratic regulator
American Control Conference, 2020Many emerging applications involve control of systems with unknown dynamics. As a result, model-free random search techniques that directly search over the space of parameters have become popular.
Hesameddin Mohammadi +2 more
semanticscholar +1 more source
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
Random Search with Resetting: A Unified Renewal Approach.
Physical Review Letters, 2018We provide a unified renewal approach to the problem of random search for several targets under resetting. This framework does not rely on specific properties of the search process and resetting procedure, allows for simpler derivation of known results ...
A. Chechkin, I. Sokolov
semanticscholar +1 more source
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
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
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
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
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 +2 more sources