2467 search results - page 241 / 494 » Finite State Machines |
181
click to vote
TCS
2008
15 years 6 months ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
175
click to vote
EUROGP
2007
Springer
16 years 26 days ago
2007
Springer
Abstract. Model checking is a way of analysing programs and programlike structures to decide whether they satisfy a list of temporal logic statements describing desired behaviour. ...
150
click to vote
FSTTCS
2007
Springer
16 years 26 days ago
2007
Springer
We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states ind...
168
click to vote
ECML
2005
Springer
16 years 7 days ago
2005
Springer
We propose in this paper a novel approach to the induction of the structure of Hidden Markov Models. The induced model is seen as a lumped process of a Markov chain. It is construc...
211
click to vote
IJCNN
2006
IEEE
16 years 22 days ago
2006
IEEE
— A solution for the slow convergence of most learning rules for Recurrent Neural Networks (RNN) has been proposed under the terms Liquid State Machines (LSM) and Echo State Netw...