Results 201 to 210 of about 468,745 (232)

Uniform error bounds of time-splitting methods for the nonlinear Dirac equation in the nonrelativistic limit regime.

, 2019
Weizhu Bao, Yongyong Cai, Jia Yin
openalex   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

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

Perturbing Uniform Ultimate Bounded Differential Systems

SIAM Journal on Mathematical Analysis, 1972
We obtain results on the eventual uniform boundedness and eventual uniform ultimate boundedness of solutions of the differential equation \[ \dot x = f(t,x) + g(t,x)\] given that solutions of the equation $\dot x = f(t,x)$ are uniformly bounded and uniformly ultimately bounded. By assuming various regularity conditions on f we obtain admissible classes
openaire   +1 more source

Bounds for Multifit Scheduling on Uniform Processors

SIAM Journal on Computing, 1983
The authors examine the nonpreemptive assignment of n independent tasks to a system of m uniform processors with the objective of reducing the makespan, or the time required from the start of execution until all tasks are completed. Since the problem of finding a minimal makespan has been shown to be np-hard, and hence unlikely to permit an efficient ...
Friesen, D. K., Langston, M. A.
openaire   +1 more source

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

Bounds for LPT Schedules on Uniform Processors

SIAM Journal on Computing, 1977
We study the performance of LPT (largest processing time) schedules with respect to optimal schedules in a nonpreemptive multiprocessor environment. The processors are assumed to have different speeds and the tasks being scheduled are independent.
Gonzalez, Teofilo, Ibarra, Oscar H., Sahni, Sartaj   +2 more
openaire   +1 more source

Lower Bounds Against Weakly-Uniform Threshold Circuits

Algorithmica, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Ruiwen, Kabanets, Valentine, Kinne, Jeff   +2 more
openaire   +2 more sources