269 search results - page 33 / 54 » Computing with Probabilistic Cellular Automata |
CONCUR
2001
Springer
15 years 2 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
71
Voted
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
ICTAC
2004
Springer
15 years 3 months ago
2004
Springer
A switched probabilistic I/O automaton is a special kind of probabilistic I/O automaton (PIOA), enriched with an explicit mechanism to exchange control with its environment. Every ...
ACSC
2004
IEEE
15 years 1 months ago
2004
IEEE
The study of self-replicating structures in Computer Science has been taking place for more than half a century, motivated by the desire to understand the fundamental principles a...