2218 search results - page 305 / 444 » Testing Expressibility Is Hard |
AOSD
2009
ACM
14 years 4 months ago
2009
ACM
Many aspects for runtime monitoring are history-based: they contain pieces of advice that execute conditionally, based on the observed execution history. History-based aspects are...
IDTRUST
2009
ACM
14 years 4 months ago
2009
ACM
Security in browsers is based upon users trusting a set of root Certificate Authorities (called Trust Anchors) which they may know little or nothing about. Browser vendors face a...
FPGA
2009
ACM
14 years 4 months ago
2009
ACM
Many natural processes exhibit exponential decay and, consequently, computational scientists make extensive use of e−x in computer simulation experiments. While it is common to ...
KDD
2009
ACM
14 years 4 months ago
2009
ACM
The Border Gateway Protocol (BGP) is one of the fundamental computer communication protocols. Monitoring and mining BGP update messages can directly reveal the health and stabilit...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...