66 search results - page 1 / 14 » Worst Cases of a Periodic Function for Large Arguments |
ARITH
2007
IEEE
13 years 11 months ago
2007
IEEE
One considers the problem of finding hard to round cases of a periodic function for large floating-point inputs, more precisely when the function cannot be efficiently approxim...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
NA
2007
13 years 4 months ago
2007
Abstract. We discuss periodization of smooth functions f of d variables for approximation of multivariate integrals. The benefit of periodization is that we may use lattice rules,...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this ...
RTSS
1994
IEEE
13 years 9 months ago
1994
IEEE
The use of caches poses a difficult tradeoff for architects of real-time systems. While caches provide significant performance advantages, they have also been viewed as inherently...