Sciweavers

9 search results - page 2 / 2
» icml 1989
Sort
View
ICML
2006
IEEE
13 years 11 months ago
Automatic basis function construction for approximate dynamic programming and reinforcement learning
We address the problem of automatically constructing basis functions for linear approximation of the value function of a Markov Decision Process (MDP). Our work builds on results ...
Philipp W. Keller, Shie Mannor, Doina Precup
ICML
1999
IEEE
14 years 6 months ago
Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples
E cient learning of DFA is a challenging research problem in grammatical inference. Both exact and approximate (in the PAC sense) identi ability of DFA from examples is known to b...
Rajesh Parekh, Vasant Honavar
ICML
1995
IEEE
14 years 6 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
ICML
1989
IEEE
13 years 9 months ago
Uncertainty Based Selection of Learning Experiences
The training experiences needed by a learning system may be selected by either an external agent or the system itself. We show that knowledge of the current state of the learner&#...
Paul D. Scott, Shaul Markovitch