4940 search results - page 55 / 988 » On the Complexity of Universal Programs |
DAC
1998
ACM
16 years 2 months ago
1998
ACM
A C++ based programming environment for the design of complex high speed ASICs is presented. The design of a 75 Kgate DECT transceiver is used as a driver example. Compact descrip...
107
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
Generic libraries, such as the C++ Standard Template Library (STL), provide flexible, high-performance algorithms and data types, along with functional specifications and performa...
106
click to vote
EUROGP
2001
Springer
15 years 6 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
111
click to vote
ASPLOS
1987
ACM
15 years 5 months ago
1987
ACM
One potentialdisadvantage of a machine with a reduced instruction. set is that object programs may be substantially larger than those for a machine with a richer, more complex ins...
122
click to vote
ISAAC
2010
Springer
14 years 12 months ago
2010
Springer
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...