332 search results - page 26 / 67 » A Direct Algorithm for Multi-valued Bounded Model Checking |
QEST
2006
IEEE
15 years 7 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
126
click to vote
COMSUR
2011
14 years 1 months ago
2011
Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the netw...
103
click to vote
ICALP
1994
Springer
15 years 5 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
138
click to vote
DAC
2004
ACM
16 years 2 months ago
2004
ACM
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
122
click to vote
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
While using more biometric traits in multimodal biometric fusion can effectively increase the system robustness, often, the cost associated to adding additional systems is not con...