Results 261 to 270 of about 12,241,994 (329)

Quantitative evaluations of time-course and effectiveness of systemic treatments for atopic dermatitis: protocol for a pharmacodynamic model-based meta-analysis. [PDF]

BMJ Open
He H, Yu B, Xu Z, Guo P.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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 Javier Solís Lozano, Roger J -B Wets   +1 more
exaly   +4 more sources

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

Random search in a bounded area

International Journal of Mathematics in Operational Research, 2017
Mohamed Abd Allah El Hadidy
exaly   +3 more sources

Distances and Finger Search in Random Binary Search Trees

SIAM Journal on Computing, 2004
Summary: For the random binary search tree with \(n\) nodes inserted the number of ancestors of the elements with ranks \(k\) and \(\ell\), \(1 \leq k < \ell \leq n\), as well as the path distance between these elements in the tree are considered. For both quantities, central limit theorems for appropriately rescaled versions are derived.
Ralph Neininger, Luc Devroye
exaly   +3 more sources