2011 search results - page 275 / 403 » Universal Reinforcement Learning |
NIPS
2003
13 years 9 months ago
2003
A novel algorithm for actively trading stocks is presented. While traditional universal algorithms (and technical trading heuristics) attempt to predict winners or trends, our app...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
LLC
2011
13 years 3 months ago
2011
Computational phonology studies sound patterns in the world’s languages from a computational perspective. This article shows that the similarities between different generative t...
ICML
1999
IEEE
14 years 9 months ago
1999
IEEE
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...
ECTEL
2009
Springer
14 years 2 months ago
2009
Springer
The work described is part of an ongoing interdisciplinary collaboration between two research teams of the University of Patras, Greece and the University of Freiburg, Germany, whi...