Results 241 to 250 of about 2,257,648 (287)

Randomizing Reductions of Search Problems

SIAM Journal on Computing, 1993
The 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.
Blass, Andreas, Gurevich, Yuri
openaire   +2 more sources

Random Searches

2007
The reverse search starts from a set of desired properties and asks for substances that possess them. Theoretical knowledge and past experience should be relied upon to suggest where to look, since it is the fastest and least expensive approach. When theoretical knowledge and past experience have been exhausted, then random searches may be the only way
openaire   +1 more source

Search along persistent random walks

Physical Biology, 2008
Optimal search strategies and their implementations in biological systems are a subject of active research. Here we study a search problem which is motivated by the hunt of sperm cells for the egg. We ask for the probability for an active swimmer to find a target under the condition that the swimmer starts at a certain distance from the target. We find
openaire   +3 more sources

Random Search Trees

1992
In this lecture we will describe a very simple probabilistic data structure that allows inserts, deletes, and membership tests (among other operations) in expected logarithmic time.
openaire   +1 more source

Search in unknown random environments

Physical Review E, 2010
N 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

Randomized binary search technique

Communications of the ACM, 1969
A 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.
Arora, S. R., Dent, W. T.
openaire   +2 more sources

Random suffix search trees

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

Randomized binary search trees

Journal of the ACM, 1998
In 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 ...
Martínez, Conrado, Roura, Salvador
openaire   +1 more source

Pure Random Search and Pure Adaptive Search

2003
A theoretical analysis of the performance of two stochastic methods is presented, pure random search (PRS) and pure adaptive search (PAS). These two random search algorithms can be viewed as extremes and are not intended to be practical algorithms, but rather are used to provide insight and bracket the performance of stochastic algorithms.
openaire   +1 more source

Random search with resetting

2018
We 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, and leads to new ones.
Chechkin, Aleksei (Prof.), Sokolov, Igor M. (Prof. Dr.)   +1 more
openaire   +1 more source