10271 search results - page 1807 / 2055 » Computer Science |
176
click to vote
CAV
2000
Springer
15 years 10 months ago
2000
Springer
xample-Guided Abstraction Refinement for Symbolic Model Checking EDMUND CLARKE YUAN LU Carnegie Mellon University, Pittsburgh, Pennsylvania Broadcom Co., San Jose, California ORNA ...
199
click to vote
IJFCS
2006
15 years 6 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
208
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
197
click to vote
IFM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
212
click to vote
SENSYS
2010
ACM
15 years 4 months ago
2010
ACM
Many participatory sensing applications use data collected by participants to construct a public model of a system or phenomenon. For example, a health application might compute a...