797 search results - page 146 / 160 » Eliminating Proofs from Programs |
141
Voted
PLDI
2012
ACM
13 years 2 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
LISA
2000
15 years 1 months ago
2000
Most denial-of-service attacks are characterized by a flood of packets with random, apparently valid source addresses. These addresses are spoofed, created by a malicious program ...
101
Voted
BMCBI
2008
15 years 18 days ago
2008
Background: Testing for selection is becoming one of the most important steps in the analysis of multilocus population genetics data sets. Existing applications are difficult to u...
145
click to vote
DSD
2011
IEEE
14 years 8 days ago
2011
IEEE
Abstract—We present a new low-level interfacing scheme for connecting custom accelerators to processors that tolerates latencies that usually occur when accessing hardware accele...
105
click to vote
COLT
1999
Springer
15 years 4 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...