269 search results - page 4 / 54 » Computing with Probabilistic Cellular Automata |
ICIAP
1999
ACM
13 years 10 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
STACS
2010
Springer
14 years 23 days ago
2010
Springer
Abstract. A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neigh...
IPL
2007
13 years 5 months ago
2007
We show that the problem of reaching a state set with probability 1 in probabilisticnondeterministic systems operating in parallel is EXPTIME-complete. We then show that this prob...
EUROGP
2003
Springer
13 years 11 months ago
2003
Springer
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers ...
ACRI
2006
Springer
13 years 11 months ago
2006
Springer
For simulating physical and chemical processes on molecular level asynchronous cellular automata with probabilistic transition rules are widely used being sometimes referred to as ...