1753 search results - page 147 / 351 » State Machines |
129
click to vote
COLT
1995
Springer
15 years 8 months ago
1995
Springer
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at...
148
click to vote
ROBOCUP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper shows how multiagent systems can be modeled by a combination of UML statecharts and hybrid automata. This allows formal system cation on different levels of ab...
142
click to vote
SBACPAD
2005
IEEE
15 years 10 months ago
2005
IEEE
Executing long-running parallel applications in Opportunistic Grid environments composed of heterogeneous, shared user workstations, is a daunting task. Machines may fail, become ...
157
click to vote
ICML
2000
IEEE
16 years 5 months ago
2000
IEEE
Hidden Markov models (HMMs) are a powerful probabilistic tool for modeling sequential data, and have been applied with success to many text-related tasks, such as part-of-speech t...
150
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We consider reinforcement learning in systems with unknown dynamics. Algorithms such as E3 (Kearns and Singh, 2002) learn near-optimal policies by using "exploration policies...