Sciweavers

1521 search results - page 20 / 305
» On Sampled Semantics of Timed Systems
Sort
View
ISCA
2011
IEEE
270views Hardware» more  ISCA 2011»
13 years 6 days ago
Sampling + DMR: practical and low-overhead permanent fault detection
With technology scaling, manufacture-time and in-field permanent faults are becoming a fundamental problem. Multi-core architectures with spares can tolerate them by detecting an...
Shuou Nomura, Matthew D. Sinclair, Chen-Han Ho, Ve...
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 3 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
QEST
2008
IEEE
14 years 2 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...
ICCS
2004
Springer
14 years 1 months ago
Improved Sampling for Biological Molecules Using Shadow Hybrid Monte Carlo
Shadow Hybrid Monte Carlo (SHMC) is a new method for sampling the phase space of large biological molecules. It improves sampling by allowing larger time steps and system sizes in ...
Scott S. Hampton, Jesús A. Izaguirre
BMVC
2010
13 years 6 months ago
Deterministic Sample Consensus with Multiple Match Hypotheses
RANSAC (Random Sample Consensus) is a popular and effective technique for estimating model parameters in the presence of outliers. Efficient algorithms are necessary for both fram...
Paul McIlroy, Edward Rosten, Simon Taylor, Tom Dru...