Results 251 to 260 of about 1,282,961 (279)

Uniform Error Bounds for Stochastic Kriging

2020 Winter Simulation Conference (WSC), 2020
In this paper, we propose an approach to construct uniform error bounds (or confidence intervals) for stochastic kriging with a prescribed confidence level. The theoretical development sheds some light on the impact of simulation experimental designs and budget allocation schemes as well as their relative importance on the large-sample properties of ...
Guangrui Xie, Xi Chen 0040
openaire   +1 more source

Uniform Bounds for a Class of Algebraic Mappings

SIAM Journal on Computing, 1979
The computation of residues with respect to a set of given moduli and the Chinese remainder algorithm can be considered a pair of general invertible algebraic mappings. This class of algebraic mappings include the more familiar mappings of evaluation and interpolation as well as forward and inverse fast Fourier transform (FFT).
openaire   +2 more sources

New Uniform Parametric Error Bounds

Journal of Optimization Theory and Applications, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Bounds on the spectral radius of uniform hypergraphs

Discrete Applied Mathematics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lele Liu, Liying Kang, Shuliang Bai
openaire   +1 more source

Approximately Uniform Online Checkpointing with Bounded Memory

Algorithmica, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahlroth, Lauri, Pottonen, Olli, Schumacher, André   +2 more
openaire   +3 more sources

Uniform and Non-uniform Bounds Under Local Dependence

2011
Chapter 9 considers local dependence using the K-function approach, and obtains both uniform and non-uniform Berry–Esseen bounds. The results are applied to certain scan statistics, and yield a general theorem when the local dependence can be expressed in terms of a dependency graph whose vertices are the underlying variables, and where two non ...
Louis H. Y. Chen, Larry Goldstein, Qi-Man Shao   +2 more
openaire   +1 more source

Tight binding number bound for P≥3-factor uniform graphs

Information Processing Letters, 2021
Wei Gao, Weifan Wang
exaly  

A Uniform Lower Bound on Weights of Perceptrons

2008
A threshold gate is a linear function of input variables with integer coefficients (weights). It outputs 1 if the value of the function is positive. The sum of absolute values of coefficients is called the total weight of the threshold gate. A perceptron of order d is a circuit of depth 2 having a threshold gate on the top level and conjunctions of fan-
openaire   +1 more source

Structure-Preserving Algorithms with Uniform Error Bound and Long-time Energy Conservation for Highly Oscillatory Hamiltonian Systems

Journal of Scientific Computing, 2023
Yao-Lin Jiang
exaly  

Bounds for List Schedules on Uniform Processors

SIAM Journal on Computing, 1980
Yookun Cho, Sartaj Sahni
openaire   +2 more sources