Results 291 to 300 of about 12,241,994 (329)
Some of the next articles are maybe not open access.
Menu search: random or systematic?
International Journal of Man-Machine Studies, 1987Abstract This paper questions the conclusion that menu search is random, not systematic. Three sources of evidence—search times per target as a function of target position, eye movement patterns during search, and the cumulative probability of locating a target as a function of time—cited in support of random search (Card, 1982, 1983) are re-examined
James N. MacGregor, Eric S. Lee
openaire +1 more source
Optimizing the success of random searches
Nature, 1999We address the general question of what is the best statistical strategy to adapt in order to search efficiently for randomly located objects ('target sites'). It is often assumed in foraging theory that the flight lengths of a forager have a characteristic scale: from this assumption gaussian, Rayleigh and other classical distributions with well ...
G M, Viswanathan +5 more
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
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics
Algorithmica, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Doerr, Carola, Doerr, Benjamin
openaire +4 more sources
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
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
Efficiency of Randomized Parallel Backtrack Search
Algorithmica, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yanjun Zhang, A. Ortynski
openaire +3 more sources
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
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
Optimal search in random quantizers
Proceedings., 11th IAPR International Conference on Pattern Recognition. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition,, 2003Signal 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 +2 more sources