3750 search results - page 103 / 750 » Timed Automata Patterns |
ISNN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper, some sufficient conditions are obtained to guarantee that discrete time cellular neural networks (DTCNNs) can have some stable memory patterns. These condi...
DASC
2006
IEEE
15 years 1 months ago
2006
IEEE
Run-time monitoring is a powerful approach for dynamically detecting faults or malicious activity of software systems. However, there are often two obstacles to the implementation...
DMTCS
2007
14 years 10 months ago
2007
A binary sequence of zeros and ones is called a (d, k)-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, b...
PVLDB
2010
14 years 8 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
DAGSTUHL
2003
14 years 11 months ago
2003
Abstract. The continuing trend towards more sophisticated technical applications results in an increasing demand for high quality software for complex, safety-critical systems. Des...