4498 search results - page 590 / 900 » How to Invent Functions |
140
click to vote
FSEN
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
155
click to vote
ICANNGA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we present application of genetic programming (GP) [1] to evolution of indirect encoding of neural network weights. We compare usage of original HyperNEAT algorithm w...
151
click to vote
IWANN
2009
Springer
15 years 11 months ago
2009
Springer
Generating test data for formal state based specifications is computationally expensive. This paper improves a framework that addresses this issue by representing the test data ge...
143
click to vote
MIDDLEWARE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Pervasive computing applications often entail continuous monitoring tasks, issuing persistent queries that return continuously updated views of the operational environmen...
138
click to vote
PDCAT
2009
Springer
15 years 11 months ago
2009
Springer
—We have proposed an auto-memoization processor. This processor automatically and dynamically memoizes both functions and loop iterations, and skips their execution by reusing th...