1242 search results - page 96 / 249 » The Theory of Grammar Constraints |
175
click to vote
FSTTCS
2006
Springer
15 years 10 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...
145
click to vote
CSL
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
148
click to vote
PLDI
2004
ACM
15 years 11 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
160
click to vote
IPCO
2007
15 years 7 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
154
click to vote
AAAI
1990
15 years 7 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...