Sciweavers

1403 search results - page 192 / 281
» About Approximations of Exponentials
Sort
View
ISCA
2007
IEEE
130views Hardware» more  ISCA 2007»
16 years 6 days ago
Dynamic prediction of architectural vulnerability from microarchitectural state
Transient faults due to particle strikes are a key challenge in microprocessor design. Driven by exponentially increasing transistor counts, per-chip faults are a growing burden. ...
Kristen R. Walcott, Greg Humphreys, Sudhanva Gurum...
ICALP
2007
Springer
16 years 2 days ago
Model Theory Makes Formulas Large
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole...
OOPSLA
2007
Springer
16 years 1 days ago
The design and implementation of formal monitoring techniques
In runtime monitoring, a programmer specifies a piece of code to execute when a trace of events occurs during program execution. Previous and related work has shown that runtime m...
Eric Bodden
SAT
2007
Springer
118views Hardware» more  SAT 2007»
16 years 1 days ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
INFOCOM
2006
IEEE
15 years 12 months ago
Broadcasting in Sensor Networks: The Role of Local Information
Abstract— Flooding based strategies are conventionally employed to perform querying and broadcasting in sensor networks. These schemes have low hop-delays of Θ( 1 M(n) ) to reac...
Sundar Subramanian, Sanjay Shakkottai, Ari Arapost...