523 search results - page 61 / 105 » Decidability of string graphs |
114
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
Number Decision Diagrams (NDD) are the automatabased symbolic representation for manipulating sets of integer vectors encoded as strings of digit vectors (least or most significa...
135
click to vote
CAV
2000
Springer
15 years 7 months ago
2000
Springer
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
120
click to vote
CSR
2006
Springer
15 years 7 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...
125
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
112
click to vote
IEEECIT
2010
IEEE
15 years 1 months ago
2010
IEEE
—The relevance of instruction parallelization and optimal event scheduling is currently increasing. In particular, because of the high amount of computational power available tod...