116 search results - page 7 / 24 » Introducing Communication in Dis-POMDPs with Finite State Ma... |
113
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
CN
2004
14 years 11 months ago
2004
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specif...
UIST
2005
ACM
15 years 5 months ago
2005
ACM
This paper describes a physically embodied and animated user interface to an interactive call handling agent, consisting of a small wireless animatronic device in the form of a sq...
ICDT
2007
ACM
15 years 5 months ago
2007
ACM
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
161
click to vote
KESAMSTA
2011
Springer
14 years 2 months ago
2011
Springer
Creating modular behaviours in JADE using a traditional method such as the FSM (Finite State Machine) can be a difficult task to achieve. The first issue with FSMs is that they do...