Sciweavers

4128 search results - page 88 / 826
» Learning and using relational theories
Sort
View
NIPS
2001
13 years 11 months ago
Rates of Convergence of Performance Gradient Estimates Using Function Approximation and Bias in Reinforcement Learning
We address two open theoretical questions in Policy Gradient Reinforcement Learning. The first concerns the efficacy of using function approximation to represent the state action ...
Gregory Z. Grudic, Lyle H. Ungar
RTA
1993
Springer
14 years 2 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ ...
Jordi Levy, Jaume Agustí-Cullell
ISAAC
2007
Springer
77views Algorithms» more  ISAAC 2007»
14 years 4 months ago
On the Relative Dominance of Paging Algorithms
In this paper we give a finer separation of several known paging algorithms. This is accomplished using a new technique that we call relative interval analysis. This technique com...
Reza Dorrigiv, Alejandro López-Ortiz, J. Ia...
ICCV
2009
IEEE
13 years 7 months ago
Kernel map compression using generalized radial basis functions
The use of Mercer kernel methods in statistical learning theory provides for strong learning capabilities, as seen in kernel principal component analysis and support vector machin...
Omar Arif, Patricio A. Vela
CAISE
2007
Springer
14 years 4 months ago
Modal Aspects of Object Types and Part-Whole Relations and the de re/de dicto Distinction
In a series of publications, we have proposed a foundational system of ontological categories which has been used to evaluate and improve the quality of conceptual modeling languag...
Giancarlo Guizzardi