336 search results - page 34 / 68 » Program Speedups in Theory and Practice |
111
click to vote
AIPS
2009
15 years 1 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
220
Voted
ICFP
2009
ACM
16 years 1 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
185
Voted
POPL
2004
ACM
16 years 24 days ago
2004
ACM
We present a formalization of the implementation of generics in the .NET Common Language Runtime (CLR), focusing on two novel aspects of the implementation: mixed specialization a...
98
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
134
Voted
APLAS
2010
ACM
14 years 11 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...