936 search results - page 52 / 188 » FSM-Hume is finite state |
BIRTHDAY
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Probabilistic systems of interacting intelligent agents are considered. They have two sources of uncertainty: uncertainty of communication channels and uncertainty of act...
COCOON
2006
Springer
14 years 17 days ago
2006
Springer
Reversible finite automata with halting states (RFA) were first considered by Ambainis and Freivalds to facilitate the research of KondacsWatrous quantum finite automata. In this ...
AGI
2011
13 years 14 days ago
2011
Under Legg’s and Hutter’s formal measure [1], performance in easy environments counts more toward an agent’s intelligence than does performance in difficult environments. An ...
ASE
2010
13 years 9 months ago
2010
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...