Sciweavers

78 search results - page 15 / 16
» Infinite Time Cellular Automata: A Real Computation Model
Sort
View
ASE
2005
137views more  ASE 2005»
13 years 5 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
RTAS
2009
IEEE
14 years 20 days ago
Lightweight Modeling of Complex State Dependencies in Stream Processing Systems
Over the last few years, Real-Time Calculus has been used extensively to model and analyze embedded systems processing continuous data/event streams. Towards this, bounds on the a...
Anne Bouillard, Linh T. X. Phan, Samarjit Chakrabo...
SAC
2004
ACM
13 years 11 months ago
Combining analysis and synthesis in a model of a biological cell
for ideas, and then abstract away from these ideas to produce algorithmic processes that can create problem solutions in a bottom-up manner. We have previously described a top-dow...
Ken Webb, Tony White
JCNS
2010
90views more  JCNS 2010»
13 years 23 days ago
Fast Kalman filtering on quasilinear dendritic trees
Optimal filtering of noisy voltage signals on dendritic trees is a key problem in computational cellular neuroscience. However, the state variable in this problem -- the vector of...
Liam Paninski
PPSN
1994
Springer
13 years 10 months ago
Genetic L-System Programming
We present the Genetic L-System Programming (GLP) paradigm for evolutionary creation and development of parallel rewrite systems (Lsystems, Lindenmayer-systems) which provide a com...
Christian Jacob