350 search results - page 40 / 70 » Lower and upper bounds on obtaining history independence |
105
click to vote
ISIPTA
1999
IEEE
15 years 4 months ago
1999
IEEE
The paper summarizes the author's experience in dealing with the Dempster-Shafer theory relating to reliability assessments and demonstrates how to make component and system ...
PODC
2009
ACM
16 years 11 days ago
2009
ACM
d Abstract] Danny Hendler Department of Computer-Science Ben-Gurion University hendlerd@cs.bgu.ac.il Philipp Woelfel Department of Computer-Science University of Calgary woelfel@cp...
108
click to vote
EMSOFT
2006
Springer
15 years 3 months ago
2006
Springer
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
115
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
LATA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the efficient simplification of regular expressions and suggest a quantitative comparison of heuristics for simplifying regular expressions. To this end, we...