Results 211 to 220 of about 539,396 (266)
Some of the next articles are maybe not open access.
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 ...
Lawrence, J. P. III, Steiglitz, Kenneth
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 ...
Lawrence, J. P. III, Steiglitz, Kenneth
openaire +2 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 ...
Appel, M. J., LaBarre, R., Radulovic, D.
openaire +1 more source
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 ...
Appel, M. J., LaBarre, R., Radulovic, D.
openaire +1 more source
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
Journal of Dynamic Systems, Measurement, and Control, 1972
The rate of convergence of a multidimensional random search is found to improve when the search region is restricted to a directed adaptive hypercone. The convergence properties of the hyperconical search algorithm are investigated and the scheme is applied to the problem of identifying twenty-two constants of a given chemical reaction from measured ...
M. J. Wozny, G. T. Heydt
openaire +1 more source
The rate of convergence of a multidimensional random search is found to improve when the search region is restricted to a directed adaptive hypercone. The convergence properties of the hyperconical search algorithm are investigated and the scheme is applied to the problem of identifying twenty-two constants of a given chemical reaction from measured ...
M. J. Wozny, G. T. Heydt
openaire +1 more source
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.
Solis, Francisco J., Wets, Roger J.-B.
openaire +2 more sources
2013
A search is defined as the action to look into or over carefully or thoroughly in an effort to find or discover something. Searching is a universal behaviour of a broad range of organisms, from bacteria to whales. In a foraging process, the search is only one component among others [1, 2].
Vicenç Méndez +2 more
openaire +1 more source
A search is defined as the action to look into or over carefully or thoroughly in an effort to find or discover something. Searching is a universal behaviour of a broad range of organisms, from bacteria to whales. In a foraging process, the search is only one component among others [1, 2].
Vicenç Méndez +2 more
openaire +1 more source
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.
Blass, Andreas, Gurevich, Yuri
openaire +2 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 along persistent random walks
Physical Biology, 2008Optimal search strategies and their implementations in biological systems are a subject of active research. Here we study a search problem which is motivated by the hunt of sperm cells for the egg. We ask for the probability for an active swimmer to find a target under the condition that the swimmer starts at a certain distance from the target. We find
openaire +3 more sources