Sciweavers

269 search results - page 24 / 54
» Computing with Probabilistic Cellular Automata
Sort
View
SASO
2008
IEEE
14 years 3 months ago
Integer Gradient for Cellular Automata: Principle and Examples
—When programming a spatial computing medium such as a cellular automaton, the hop count distance to some set of sources (particles) is an often used information. In particular, ...
Luidnel Maignan, Frédéric Gruau
CA
2003
IEEE
14 years 1 months ago
Melting and Flowing of Viscous Volumes
We present a simple, linear 3D cellular automata approach for animating the melting process of solid volumetric models. Accurate modelling of object melting usually requires compl...
Xiaoming Wei, Wei Li, Arie E. Kaufman
PACT
2005
Springer
14 years 2 months ago
Optimal Behavior of a Moving Creature in the Cellular Automata Model
The goal of our investigation is to find automatically the best rule for a cell in the cellular automata model. The cells are either of type Obstacle, Empty or Creature. Only Crea...
Mathias Halbach, Rolf Hoffmann
ISVLSI
2006
IEEE
95views VLSI» more  ISVLSI 2006»
14 years 2 months ago
PLAs in Quantum-dot Cellular Automata
Abstract— Research in the fields of physics, chemistry and electronics has demonstrated that Quantum-dot Cellular Automata (QCA) is a viable alternative for nano-scale computing...
Xiaobo Sharon Hu, Michael Crocker, Michael T. Niem...
GECCO
2008
Springer
157views Optimization» more  GECCO 2008»
13 years 9 months ago
Self-adaptive mutation rates in genetic algorithm for inverse design of cellular automata
Self-adaptation is used a lot in Evolutionary Strategies and with great success, yet for some reason it is not the mutation adaptation of choice for Genetic Algorithms. This poste...
Ron Breukelaar, Thomas Bäck