Results 251 to 260 of about 5,098,223 (303)

Minimization by Random Search Techniques

Mathematics of Operations Research, 1981
We 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

On Accelerated Random Search

SIAM Journal on Optimization, 2004
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   +3 more sources

Continuous Functions Minimization by Dynamic Random Search Technique

Applied Mathematical Modelling, 2007
Random search technique is the simplest one of the heuristic algorithms. It is stated in the literature that the probability of finding global minimum is equal to 1 by using the basic random search technique, but it takes too much time to reach the ...
Coşkun HAMZAÇEBİ, Fevzi Kutay
exaly   +2 more sources

Randomized Pattern Search

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   +3 more sources

Randomized search trees

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

A note on randomized mutual search

Information Processing Letters, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zvi Lotker, Boaz Patt-Shamir
openaire   +3 more sources

Randomizing Reductions of Search Problems

SIAM Journal on Computing, 1993
This paper closes a gap in the foundations of the theory of average-case complexity. First, it clarifies the notion of a feasible solution for a search problem and proves its robustness. Second, it gives a general and usable notion of many–one randomizing reductions of search problems and proves that it has desirable properties.
Andreas Blass, Yuri Gurevich
openaire   +3 more sources

Search for the maximum of a random walk

Random Structures & Algorithms, 1992
AbstractThis 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, 1998
In 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