Sciweavers

4498 search results - page 152 / 900
» How to Invent Functions
Sort
View
123
Voted
NIPS
2007
15 years 4 months ago
Stable Dual Dynamic Programming
Recently, we have introduced a novel approach to dynamic programming and reinforcement learning that is based on maintaining explicit representations of stationary distributions i...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
105
Voted
SIMVIS
2003
15 years 4 months ago
Interest Value Driven Adaptive Subdivision
This paper generalizes adaptive subdivision algorithms by introducing an applicationdependent Degree of Interest function. Therefore, geometry-related as well as geometry-independ...
Tobias Isenberg, Knut Hartmann, Henry König
89
Voted
ACL
1996
15 years 4 months ago
Processing Complex Sentences in the Centering Framework
We extend the centering model for the resolution of intia-sentential anaphora and specify how to handle complex sentences. An empirical evaluation indicates that the functional in...
Michael Strube
103
Voted
MLQ
2008
67views more  MLQ 2008»
15 years 2 months ago
Classical truth in higher types
We study, from a classical point of view, how the truth of a statement about higher type functionals depends on the underlying model. The models considered are the classical set-t...
Ulrich Berger
APAL
2000
61views more  APAL 2000»
15 years 2 months ago
Higher type recursion, ramification and polynomial time
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...
Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Sc...