3750 search results - page 377 / 750 » Timed Automata Patterns |
162
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
131
click to vote
CPM
1993
Springer
15 years 8 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
159
click to vote
PDPTA
2000
15 years 5 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
145
click to vote
ICLP
2005
Springer
15 years 10 months ago
2005
Springer
We present a methodology for the modeling of complex program behavior in CLP. In the first part we present an informal description about how to represent a system in CLP. At its ...
187
click to vote
EMSOFT
2006
Springer
15 years 8 months ago
2006
Springer
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...