908 search results - page 52 / 182 » Stochastic Finite Learning |
ICGI
1998
Springer
14 years 1 months ago
1998
Springer
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
ANLP
2000
13 years 10 months ago
2000
A finite-state method, based on leftmost longestmatch replacement, is presented for segmenting words into graphemes, and for converting graphemes into phonemes. A small set of han...
ECML
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. For large state-space Markovian Decision Problems MonteCarlo planning is one of the few viable approaches to find near-optimal solutions. In this paper we introduce a new...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We study the polynomial reconstruction problem for low-degree multivariate polynomials over finite field F[2]. In this problem, we are given a set of points x ∈ {0, 1}n and ta...
ECML
2006
Springer
14 years 14 days ago
2006
Springer
Reinforcement learning in real-world domains suffers from three curses of dimensionality: explosions in state and action spaces, and high stochasticity. We present approaches that ...