43 search results - page 7 / 9 » Deaccumulation techniques for improving provability |
COLT
2003
Springer
15 years 2 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
COMPGEOM
1993
ACM
15 years 1 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
75
Voted
FSE
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
87
Voted
CAV
2007
Springer
15 years 3 months ago
2007
Springer
We present new techniques for fast, accurate and scalable static data race detection in concurrent programs. Focusing our analysis on Linux device drivers allowed us to identify th...