Sciweavers

3750 search results - page 86 / 750
» Timed Automata Patterns
Sort
View
ALT
2010
Springer
14 years 6 days ago
A Lower Bound for Learning Distributions Generated by Probabilistic Automata
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
Borja Balle, Jorge Castro, Ricard Gavaldà
ENTCS
2008
109views more  ENTCS 2008»
13 years 10 months ago
Spatial Networks of Hybrid I/O Automata for Modeling Excitable Tissue
We propose a new biological framework, spatial networks of hybrid input/output automata (SNHIOA), for the efficient modeling and simulation of excitable-cell tissue. Within this f...
Ezio Bartocci, Flavio Corradini, Maria Rita Di Ber...
CIT
2006
Springer
14 years 2 months ago
A High Performance ASIC for Cellular Automata (CA) Applications
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...
Cheryl A. Kincaid, Saraju P. Mohanty, Armin R. Mik...
DEBS
2009
ACM
14 years 5 months ago
Distributed event stream processing with non-deterministic finite automata
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...
VTS
1997
IEEE
86views Hardware» more  VTS 1997»
14 years 2 months ago
Methods to reduce test application time for accumulator-based self-test
Accumulators based on addition or subtraction can be used as test pattern generators. Some circuits, however, require long test lengths if the parameters of the accumulator are no...
Albrecht P. Stroele, Frank Mayer