Sciweavers

9284 search results - page 95 / 1857
» Knowledge State Algorithms
Sort
View
TACAS
1997
Springer
146views Algorithms» more  TACAS 1997»
15 years 6 months ago
Compositional State Space Generation from Lotos Programs
This paper describes a compositional approach to generate the labeled transition system representing the behavior of a Lotos program by repeatedly alternating composition and reduc...
Jean-Pierre Krimm, Laurent Mounier
COLING
2002
15 years 2 months ago
Disambiguation of Finite-State Transducers
The objective of this work is to disambiguate transducers which have the following form: T = R D and to be able to apply the determinization algorithm described in (Mohri, 1997)....
N. Smaili, Patrick Cardinal, Gilles Boulianne, Pie...
NAACL
2010
15 years 12 days ago
Bayesian Inference for Finite-State Transducers
We describe a Bayesian inference algorithm that can be used to train any cascade of weighted finite-state transducers on end-toend data. We also investigate the problem of automat...
David Chiang, Jonathan Graehl, Kevin Knight, Adam ...
NECO
2010
103views more  NECO 2010»
15 years 27 days ago
Posterior Weighted Reinforcement Learning with State Uncertainty
Reinforcement learning models generally assume that a stimulus is presented that allows a learner to unambiguously identify the state of nature, and the reward received is drawn f...
Tobias Larsen, David S. Leslie, Edmund J. Collins,...
ATAL
2008
Springer
15 years 4 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...