Results 231 to 240 of about 557,643 (265)

The Impact of Random Initialization on the Runtime of Randomized Search Heuristics

Algorithmica, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doerr, Carola, Doerr, Benjamin
openaire   +3 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

Distances and Finger Search in Random Binary Search Trees

SIAM Journal on Computing, 2004
Summary: 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,, 2003
Signal 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

On the Generation of Random Binary Search Trees

SIAM Journal on Computing, 1995
Summary: We consider the computer generation of random binary search trees with \(n\) nodes for the standard random permutation model. The algorithms discussed here output the number of external nodes at each level, but not the shape of the tree. This is important, for example, when one wishes to simulate the height of the binary search tree.
Luc Devroye, J. M. Robson
openaire   +1 more source

Random combinatorial structures and randomized search heuristics

2010
Diese Dissertationsschrift beschäftigt sich mit der wahrscheinlichkeitstheoretischen Analyse von zufälligen kombinatorischen Strukturen und der Laufzeitanalyse randomisierter Suchheuristiken. Im Bereich der zufälligen Strukturen untersuchen wir zwei Klassen kombinatorischer Objekte.
openaire   +3 more sources

Dichotomous Search for Random Objects on an Interval

Mathematics of Operations Research, 1984
A set of objects to be searched is represented by a set of points lying in an interval of integers. We wish to identify these points within unit-intervals through a dichotomous search, minimizing the expected cost of the search. The optimal search strategy may depend on the information gained at each stage of the search.
Refael Hassin, Mordechai I. Henig
openaire   +1 more source

Random Multivariate Search Trees

2006
Trees are commonly used to store data so that they can be efficiently retrieved and used in applications. For multidimensional data, one could consider kd-trees, quadtrees, BSP trees, simplex trees, grid trees, epsilon nets, and many other structures. The height of these trees is logarithmic in the data size for random input.
openaire   +1 more source

Tabu search vs. Random walk

1997
We investigate the benefit of Tabu Search for satisfiability (SAT) and constraint satisfaction problems (CSP and compare it to the more frequently used random walk heuristic. We argue, that a more deterministic direction of search as done with Tabu Search is worth considering also for SAT and CSP.
Steinmann, Olaf, Strohmaier, Antje, Stützle, Thomas   +2 more
openaire   +2 more sources

Artificial bee colony based on adaptive search strategy and random grouping mechanism

Expert Systems With Applications, 2022
Zhihua Cui, , Zhao Jia
exaly