3169 search results - page 140 / 634 » Robust Timed Automata |
157
Voted
IANDC
2007
15 years 2 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
138
click to vote
TCS
2008
15 years 2 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
158
click to vote
ICC
2011
IEEE
14 years 2 months ago
2011
IEEE
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
156
Voted
ESANN
2004
15 years 3 months ago
2004
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
110
click to vote
AIPS
2004
15 years 4 months ago
2004
This paper considers the problem of generating partial order schedules (