Sciweavers

2805 search results - page 226 / 561
» Modeling Memory for Melodies
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
15 years 6 months ago
Computing Over-Approximations with Bounded Model Checking
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
Daniel Kroening
TIT
2008
111views more  TIT 2008»
15 years 6 months ago
The Bounded-Storage Model in the Presence of a Quantum Adversary
An extractor is a function that is used to extract randomness. Given an imperfect random source X and a uniform seed Y , the output (X; Y ) is close to uniform. We study properties...
Robert T. König, Barbara M. Terhal
IJPP
2011
99views more  IJPP 2011»
15 years 1 months ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
TACAS
2009
Springer
106views Algorithms» more  TACAS 2009»
16 years 1 months ago
Hierarchical Set Decision Diagrams and Regular Models
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...
Yann Thierry-Mieg, Denis Poitrenaud, Alexandre Ham...
IPPS
2007
IEEE
16 years 28 days ago
A Model for Large Scale Self-Stabilization
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...
Thomas Hérault, Pierre Lemarinier, Olivier ...