Results 241 to 250 of about 4,872,287 (279)

Results of a multicenter, randomized, open-label trial comparing basiliximab vs. steroids in HCV liver transplant patients

open access: yes, 2007
Salizzoni, M. Search   +13 more
core  

Hardware acceleration of simulated annealing for constraint satisfaction problems. [PDF]

open access: yesNat Commun
Pannone A   +10 more
europepmc   +1 more source

Influenza-Like Illness Forecasting Using Multisource Data: Comparative Deep Learning Study. [PDF]

open access: yesJMIR Med Inform
Dang C   +9 more
europepmc   +1 more source

On Accelerated Random Search

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
openaire   +2 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

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

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
openaire   +2 more sources

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

Home - About - Disclaimer - Privacy