Results 251 to 260 of about 1,679,233 (282)
Some of the next articles are maybe not open access.
Bounds for Multifit Scheduling on Uniform Processors
SIAM Journal on Computing, 1983The 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 ...
Donald K. Friesen, Michael A. Langston
openaire +1 more source
A Uniform Circuit Lower Bound for the Permanent
SIAM Journal on Computing, 1994We show that uniform families of ACC circuits of subexponential size cannot compute the permanent function. This also implies similar lower bounds for certain sets in PP. This is one of the very few examples of a lower bound in circuit complexity where the uniformity condition is essential; it is still unknown if there is any set in Ntime (2nO(1 ...
Allender, Eric, Gore, Vivek
openaire +3 more sources
Bounds for LPT Schedules on Uniform Processors
SIAM Journal on Computing, 1977We 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.
Teofilo F. Gonzalez +2 more
openaire +1 more source
Uniform Error Bounds for Stochastic Kriging
2020 Winter Simulation Conference (WSC), 2020In 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, 1979The 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
Bounds on the spectral radius of uniform hypergraphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lele Liu, Liying Kang, Shuliang Bai
openaire +1 more source
New Uniform Parametric Error Bounds
Journal of Optimization Theory and Applications, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Approximately Uniform Online Checkpointing with Bounded Memory
Algorithmica, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schumacher André +2 more
openaire +4 more sources
A Uniform Lower Bound on Weights of Perceptrons
2008A 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 +2 more sources
A note on totally bounded quasi-uniformities
2009Summary: We present the original proof, based on the Doitchinov completion [\textit{D. Doitchinov}, C. R. Acad. Bulg. Sci. 41, No. 7, 5-8 (1988; Zbl 0649.54015); Topology Appl. 30, No. 2, 127-148 (1988; Zbl 0668.54019); 38, No. 3, 205-217 (1991; Zbl 0723.54030)], that a totally bounded quiet quasi-informity is a uniformity. The proof was obtained about
Fletcher, P., Hunsaker, W.
openaire +2 more sources