6719 search results - page 1151 / 1344 » A Generalization of Automatic Sequences |
250
click to vote
POPL
2006
ACM
16 years 5 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
262
click to vote
POPL
2005
ACM
16 years 5 months ago
2005
ACM
Dynamic software updates can be used to fix bugs or add features to a running program without downtime. Essential for some applications and convenient for others, low-level dynami...
159
click to vote
CADE
2005
Springer
16 years 5 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
147
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often re...
142
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...