187 search results - page 3 / 38 » Computing Special Values of Partial Zeta Functions |
TCAD
2002
13 years 5 months ago
2002
The objective of this work is to create a framework for the optimization of embedded software. We present algorithms and a tool flow to reduce the computational effort of programs,...
ICNC
2005
Springer
13 years 11 months ago
2005
Springer
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...
Publication
_1990.jpg "Arity Raiser and its Use in Program Specialization")
Experiments on generating compilers by specializing specializers with respect to interpreters have shown that the compilers thus obtained have a natural structure only if the speci...
COSIT
2001
Springer
13 years 10 months ago
2001
Springer
The development of cognitively plausible models of human spatial reasoning may ultimately result in computational systems that are better equipped to meet human needs. This paper e...
JUCS
2007
13 years 6 months ago
2007
: We investigate the computational power of C++ compilers. In particular, it is known that any partial recursive function can be computed at compile time, using the template mechan...