503 search results - page 66 / 101 » Probabilistic Weighted Automata |
147
click to vote
TROB
2010
15 years 1 months ago
2010
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
114
click to vote
FOSSACS
2004
Springer
15 years 8 months ago
2004
Springer
Labelled Markov processes (LMPs) are automata whose transitions are given by probability distributions. In this paper we present a ‘universal’ LMP as the spectrum of a commutat...
117
click to vote
TSMC
2002
15 years 2 months ago
2002
Abstract--We present the STack ARchitecture (STAR) automaton. It is a fixed structure, multiaction, reward-penalty learning automaton, characterized by a star-shaped state transiti...
144
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
146
click to vote
ACL
2012
13 years 5 months ago
2012
Many semantic parsing models use tree transformations to map between natural language and meaning representation. However, while tree transformations are central to several state-...