163 search results - page 11 / 33 » An Introduction to Probabilistic Automata |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
CSFW
2007
IEEE
14 years 2 months ago
2007
IEEE
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
ASIAN
2003
Springer
14 years 28 days ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
UPP
2004
Springer
14 years 1 months ago
2004
Springer
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We propose a technique for pattern classification in symbolic streams via selective erasure of observed symbols, in cases where the patterns of interest are represented as Probabil...