Sciweavers

170 search results - page 30 / 34
» A Bounding Quantifier
Sort
View
ISCA
2007
IEEE
120views Hardware» more  ISCA 2007»
14 years 1 months ago
Examining ACE analysis reliability estimates using fault-injection
ACE analysis is a technique to provide an early reliability estimate for microprocessors. ACE analysis couples data from performance models with low level design details to identi...
Nicholas J. Wang, Aqeel Mahesri, Sanjay J. Patel
AIPS
2006
13 years 8 months ago
Combining Knowledge Compilation and Search for Conformant Probabilistic Planning
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
Jinbo Huang
TON
2008
103views more  TON 2008»
13 years 7 months ago
On the race of worms, alerts, and patches
We study the effectiveness of automatic patching and quantify the speed of patch or alert dissemination required for worm containment. We focus on random scanning as this is repres...
Milan Vojnovic, Ayalvadi J. Ganesh
CCR
2004
95views more  CCR 2004»
13 years 7 months ago
A Per-Domain Behavior for circuit emulation in IP networks
Circuit networks are expensive to build, difficult to operate, fragile, and not easily scalable. Many network operators would like to carry circuit traffic as an overlay on top of...
Kathleen M. Nichols, Van Jacobson, Kedarnath Podur...
ACSAC
2010
IEEE
12 years 11 months ago
A quantitative analysis of the insecurity of embedded network devices: results of a wide-area scan
We present a quantitative lower bound on the number of vulnerable embedded device on a global scale. Over the past year, we have systematically scanned large portions of the inter...
Ang Cui, Salvatore J. Stolfo