4498 search results - page 169 / 900 » How to Invent Functions |
135
click to vote
LOPSTR
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
140
click to vote
LPAR
1999
Springer
15 years 8 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
110
click to vote
DAC
1997
ACM
15 years 8 months ago
1997
ACM
CAD tools and research in the area of reduced-order modeling of largelinearinterconnect networkshaveevolved from merely finding a Pad´e approximation for the given network trans...
141
click to vote
STOC
1996
ACM
15 years 8 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
117
click to vote
UIST
1994
ACM
15 years 8 months ago
1994
ACM
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...