163 search results - page 8 / 33 » An Introduction to Probabilistic Automata |
CONCUR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
ICALP
2010
Springer
14 years 14 days ago
2010
Springer
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
ICTAI
2003
IEEE
2003
IEEE
Genetic Algorithm Calibration of Probabilistic Cellular Automata for Modeling Mining Permit Activity
14 years 29 days ago
We use a genetic algorithm to calibrate a spatially and temporally resolved cellular automata to model mining activity on public land in Idaho and western Montana. The genetic alg...
ENTCS
2006
13 years 7 months ago
2006
Anonymity means that the identity of the user performing a certain action is maintained secret. The protocols for ensuring anonymity often use random mechanisms which can be descr...
TCS
2008
13 years 7 months ago
2008
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...