Results 261 to 270 of about 609,466 (311)
Some of the next articles are maybe not open access.
Minimization by Random Search Techniques
Mathematics of Operations Research, 1981We give two general convergence proofs for random search algorithms. We review the literature and show how our results extend those available for specific variants of the conceptual algorithm studied here. We then exploit the convergence results to examine convergence rates and to actually design implementable methods.
FRANCISCO J Solis, Roger J -B Wets
exaly +3 more sources
SIAM Journal on Optimization, 2004
Summary: A new variant of pure random search (PRS) for function optimization is introduced. The basic finite-descent accelerated random search (ARS) algorithm is simple: the search is confined to shrinking neighborhoods of a previous record-generating value, with the search neighborhood reinitialized to the entire space when a new record is found ...
M. J. Appel, R. LaBarre, D. Radulovic
exaly +2 more sources
Summary: A new variant of pure random search (PRS) for function optimization is introduced. The basic finite-descent accelerated random search (ARS) algorithm is simple: the search is confined to shrinking neighborhoods of a previous record-generating value, with the search neighborhood reinitialized to the entire space when a new record is found ...
M. J. Appel, R. LaBarre, D. Radulovic
exaly +2 more sources
IEEE Transactions on Computers, 1972
A random search technique for function minimization is proposed that incorporates the step-size and direction adaptivity of Hooke and Jeeves' [1] pattern search. Experimental results for a variety of functions indicate that the random pattern search is more effective than the corresponding deterministic method for a class of problems with hard ...
J. P. Lawrence, Kenneth Steiglitz
openaire +2 more sources
A random search technique for function minimization is proposed that incorporates the step-size and direction adaptivity of Hooke and Jeeves' [1] pattern search. Experimental results for a variety of functions indicate that the random pattern search is more effective than the corresponding deterministic method for a class of problems with hard ...
J. P. Lawrence, Kenneth Steiglitz
openaire +2 more sources
30th Annual Symposium on Foundations of Computer Science, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire +1 more source
A note on randomized mutual search
Information Processing Letters, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zvi Lotker, Boaz Patt-Shamir
openaire +2 more sources
Randomizing Reductions of Search Problems
SIAM Journal on Computing, 1993The 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.
Andreas Blass, Yuri Gurevich
openaire +2 more sources
Search for the maximum of a random walk
Random Structures & Algorithms, 1992AbstractThis paper examines the efficiency of various strategies for searching in an unknown environment. The model is that of the simple random walk, which can be taken as a representation of a function with a bounded derivative that is difficult to compute. Let X1, X2+,. be independent and identically distributed with Prob(Xj = 1) = Prob(Xj = ‐1) = 1/
openaire +2 more sources
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 ...
Conrado Martínez, Salvador Roura
openaire +1 more source
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.
S. R. Arora, W. T. Dent
openaire +2 more sources
Searching for Patterns in Random Sequences.
Canadian Journal of Experimental Psychology / Revue canadienne de psychologie expérimentale, 2004In a probability-guessing paradigm, participants predict which of two events will occur on each trial. Participants generally frequency match even though frequency matching is nonoptimal with random sequences. The optimal strategy is to guess the most frequent event, maximizing. We hypothesize that frequency matching results from a search for patterns,
George, Wolford +3 more
openaire +2 more sources