Sciweavers

4757 search results - page 109 / 952
» Monads for Functional Programming
Sort
View
ALP
1997
Springer
15 years 8 months ago
Optimal Non-deterministic Functional Logic Computations
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
Sergio Antoy
CCS
2005
ACM
15 years 10 months ago
The framework of selective interleaving functions and the modular assembly kit
The Framework of Selective Interleaving Functions and the Modular Assembly Kit for Security Properties both provide a basis for the uniform representation and formal analysis of n...
Heiko Mantel
GECCO
2005
Springer
136views Optimization» more  GECCO 2005»
15 years 10 months ago
Preventing overfitting in GP with canary functions
Overfitting is a fundamental problem of most machine learning techniques, including genetic programming (GP). Canary functions have been introduced in the literature as a concept ...
Nate Foreman, Matthew P. Evett
NIPS
1994
15 years 6 months ago
Generalization in Reinforcement Learning: Safely Approximating the Value Function
To appear in: G. Tesauro, D. S. Touretzky and T. K. Leen, eds., Advances in Neural Information Processing Systems 7, MIT Press, Cambridge MA, 1995. A straightforward approach to t...
Justin A. Boyan, Andrew W. Moore
PPDP
2010
Springer
15 years 3 months ago
Functional derivation of a virtual machine for delimited continuations
This paper connects the definitional interpreter for the λ-calculus extended with delimited continuation constructs, shift and reset, with a compiler and a low-level virtual mac...
Kenichi Asai, Arisa Kitani