4940 search results - page 60 / 988 » On the Complexity of Universal Programs |
136
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
145
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
122
click to vote
OSDI
2008
ACM
16 years 4 months ago
2008
ACM
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentally-intensive prog...
127
click to vote
SAS
1991
Springer
15 years 7 months ago
1991
Springer
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
146
click to vote
GECCO
2010
Springer
15 years 6 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...