198 search results - page 37 / 40 » Learning Unary Automata |
BC
2008
13 years 7 months ago
2008
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...
TCS
2008
13 years 6 months ago
2008
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
ICTAI
2000
IEEE
13 years 11 months ago
2000
IEEE
Abstract— Polling policies have been introduced to simplify the accessing process in client/server systems by a centralized control access scheme. This paper considers a client/s...
ANSS
2000
IEEE
13 years 11 months ago
2000
IEEE
We present, in this paper, an algorithm which integrates flow control and dynamic load balancing in Time Warp. The algorithm is intended for use in a distributed memory environme...