2632 search results - page 125 / 527 » Alternating Timed Automata |
127
click to vote
QEST
2008
IEEE
15 years 9 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
127
click to vote
RTAS
2003
IEEE
15 years 8 months ago
2003
IEEE
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
147
click to vote
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
128
Voted
GLVLSI
2002
IEEE
15 years 8 months ago
2002
IEEE
We present a novel test scheduling algorithm for embedded corebased SoC’s. Given a system integrated with a set of cores and a set of test resources, we select a test for each c...
152
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...