269 search results - page 16 / 54 » Computing with Probabilistic Cellular Automata |
CG
2010
Springer
13 years 8 months ago
2010
Springer
Cyclic cellular automata on the integer planar lattice are known to typically evolve through distinct phases ending with minimal periodic terminal states that usually appear as in...
NETGAMES
2006
ACM
14 years 2 months ago
2006
ACM
ÌÓ Ô ÓÒÐ Ò Ñ × ÒØ Ö ×Ø Ò ØÓ Ø Ö ÔÐ Ý Ö׸ Ø × Ñ¹ ÔÓÖØ ÒØ ØÓ Ø Ø ÔÐ Ý Ö׳ Ú ÓÖ׺ ÁÒ Ø × Ô Ô Ö¸ Ò ÓÖ Ö ØÓ ÙÒ Ö×Ø ...
PACT
2001
Springer
14 years 1 months ago
2001
Springer
STACS
2009
Springer
14 years 3 months ago
2009
Springer
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
UC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. It is an unconventional computation approach to evolve solutions instead of calculating them. Although using evolutionary computation in computer science dates back to th...