Results 281 to 290 of about 13,863,967 (339)

SPHTRLM: secure and privacy-preserving hyperparameter-tuned reinforcement learning method for robot path finding in dynamic environments. [PDF]

Sci Rep
Dewangan RR, Thombre D, Parganiha V, Verma M, Pimpalkar A, Dewangan BK, Shelke N.   +6 more
europepmc   +1 more source

Fenestration of Medial Rectus Muscle versus Combined Resection Recession for Management of Near-Distance Disparity Esotropia. [PDF]

Clin Ophthalmol
Ghali MA, El-Aidy LA, Nasr AA.
europepmc   +1 more source

Convergences of Prices and Rates of Inflation [PDF]

SSRN Electronic Journal, 2006
AbstractWe consider how unit‐root and stationarity tests can be used to study the convergence of prices and rates of inflation. We show how the joint use of these tests in levels and first differences allows the researcher to distinguish between series that are converging and series that have already converged, and we set out a strategy to establish ...
Fabio Busetti, Silvia Fabiani, Andrew Harvey   +2 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Convergence rates analysis of a multiobjective proximal gradient method

Optimization Letters, 2020
Many descent algorithms for multiobjective optimization have been developed in the last two decades. Tanabe et al. (Comput Optim Appl 72(2):339–361, 2019) proposed a proximal gradient method for multiobjective optimization, which can solve multiobjective
H. Tanabe, E. H. Fukuda, Nobuo Yamashita
semanticscholar   +1 more source

Convergence rates of high dimensional Smolyak quadrature

ESAIM: Mathematical Modelling and Numerical Analysis, 2020
We analyse convergence rates of Smolyak integration for parametric maps u: U → X taking values in a Banach space X, defined on the parameter domain U = [−1,1]N. For parametric maps which are sparse, as quantified by summability of their Taylor polynomial
J. Zech, C. Schwab
semanticscholar   +1 more source

Rates of convergence for Quicksort

Journal of Algorithms, 2002
Summary: The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of convergence to be of the order \(\theta(\ln(n)/n)\) in the Zolotarev metric.
Ralph Neininger, Ludger Rüschendorf
openaire   +3 more sources

Verification of Reduced Convergence Rates

Computing, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hsin-Yun Hu, Zi-Cai Li
openaire   +2 more sources

Rate of Convergence to a Stable Law

SIAM Journal on Applied Mathematics, 2001
The paper deals with the densities of normalized sums of i.i.d. random variables with stable limit law. Under various conditions when the tails are finally of Pareto type (or mixtures of them) the authors introduce uniform rates for the convergence of the densities to the stable densities.
Joseph B. Keller, Rachel Kuske
openaire   +2 more sources