168 search results - page 1 / 34 » Abstract Interpretation for Worst and Average Case Analysis |
BIRTHDAY
2006
Springer
13 years 8 months ago
2006
Springer
Interpretation for Worst and Average Case Analysis Alessandra Di Pierro1 , Chris Hankin2 , and Herbert Wiklicky2 1 Dipartimento di Informatica, University of Pisa, Italy 2 Departme...
STACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
DATE
2005
IEEE
13 years 10 months ago
2005
IEEE
Test sets that detect each target fault n times (n-detection test sets) are typically generated for restricted values of n due to the increase in test set size with n. We perform ...
WCET
2003
13 years 6 months ago
2003
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
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...