187 search results - page 9 / 38 » Computing Special Values of Partial Zeta Functions |
SIAMCOMP
2008
14 years 9 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
ESOP
1990
Springer
15 years 1 months ago
1990
Springer
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
UAI
2001
14 years 11 months ago
2001
In previous work [8] we presented a casebased approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user prefe...
ESOP
2005
Springer
15 years 3 months ago
2005
Springer
Program slicing is a well-known methodology that aims at identifying the program statements that (potentially) affect the values computed at some point of interest. Within imperat...