4940 search results - page 56 / 988 » On the Complexity of Universal Programs |
104
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
136
click to vote
ENTCS
2006
15 years 2 months ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
130
click to vote
LPNMR
2007
Springer
15 years 8 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
229
click to vote
POPL
2009
ACM
16 years 2 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...