Results 281 to 290 of about 609,466 (311)
Some of the next articles are maybe not open access.
On the Generation of Random Binary Search Trees
SIAM Journal on Computing, 1995Summary: 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
2010Diese 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, 1984A 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
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
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
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 +2 more
openaire +2 more sources
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 +2 more
openaire +2 more sources
Random Multivariate Search Trees
2006Trees 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
Artificial bee colony based on adaptive search strategy and random grouping mechanism
Expert Systems With Applications, 2022Tao Zeng, Wenjun Wang, Hui Wang
exaly
Random projection-based auxiliary information can improve tree-based nearest neighbor search
Information Sciences, 2021Kaushik Sinha
exaly
Soil Erosion Status Prediction Using a Novel Random Forest Model Optimized by Random Search Method
Sustainability, 2023Zahraa Tarek +2 more
exaly
Random search in a bounded area
International Journal of Mathematics in Operational Research, 2017Abd El-Moneim AnwarMohamed Teamah +2 more
openaire +1 more source