Sciweavers

936 search results - page 71 / 188
» FSM-Hume is finite state
Sort
View
IJCAI
1993
13 years 10 months ago
Learning Finite Automata Using Local Distinguishing Experiments
One of the open problems listed in Rivest and Schapire, 1989] is whether and how that the copies of L in their algorithm can be combined into one for better performance. This pape...
Wei-Mein Shen
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
14 years 3 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
ICC
2009
IEEE
184views Communications» more  ICC 2009»
14 years 3 months ago
A 3-D Markov Chain Queueing Model of IEEE 802.11 DCF with Finite Buffer and Load
—We introduce a 3-dimensional Markov chain that integrates the IEEE 802.11 DCF contention resolution and queueing processes into one model. Important QoS measures, delay and loss...
Ren Ping Liu, Gordon Sutton, Iain B. Collings
IHM
2004
ACM
14 years 2 months ago
Couplage de ressources d'interaction
Although coupling interaction resources is key to ubiquitous computing, this notion has been overlooked in previous studies. In this paper, we address this notion in a more system...
Nicolas Barralon, Christophe Lachenal, Joëlle...
BC
2008
134views more  BC 2008»
13 years 9 months ago
Interacting with an artificial partner: modeling the role of emotional aspects
In this paper we introduce a simple model based on probabilistic finite state automata to describe an emotional interaction between a robot and a human user, or between simulated a...
Isabella Cattinelli, Massimiliano Goldwurm, N. Alb...