116 search results - page 5 / 24 » Introducing Communication in Dis-POMDPs with Finite State Ma... |
94
Voted
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
81
Voted
GECCO
2007
Springer
15 years 5 months ago
2007
Springer
With resemblance of finite-state machines to some biological mechanisms in cells and numerous applications of finite automata in different fields, this paper uses analogies an...
114
click to vote
FASE
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...
113
click to vote
ACL
1997
15 years 29 days ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
111
Voted
FORTE
2008
15 years 1 months ago
2008
Network-based fuzz testing has become an effective mechanism to ensure the security and reliability of communication protocol systems. However, fuzz testing is still conducted in a...