Results 221 to 230 of about 539,396 (266)
Some of the next articles are maybe not open access.
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
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, 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
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.
Arora, S. R., Dent, W. T.
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
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 ...
Martínez, Conrado, Roura, Salvador
openaire +1 more source
Pure Random Search and Pure Adaptive Search
2003A 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
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.) +1 more
openaire +1 more source
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.) +1 more
openaire +1 more source
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
Noble-Metal Based Random Alloy and Intermetallic Nanocrystals: Syntheses and Applications
Chemical Reviews, 2021Ming Zhou, Can Li, Jiye Fang
exaly