Sciweavers

269 search results - page 7 / 54
» Computing with Probabilistic Cellular Automata
Sort
View
DAC
2003
ACM
14 years 9 months ago
Quantum-dot cellular automata: computing by field polarization
As CMOS technology continues its monotonic shrink, computing with quantum dots remains a goal in nanotechnology research. Quantum-dot cellular automata (QCA) is a paradigm for low...
Gary H. Bernstein
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 6 months ago
A Categorical Outlook on Cellular Automata
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comona...
Silvio Capobianco, Tarmo Uustalu
IPPS
2000
IEEE
14 years 1 months ago
Solving Problems on Parallel Computers by Cellular Programming
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
Domenico Talia
TAMC
2009
Springer
14 years 3 months ago
Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...
Jasper Berendsen, Taolue Chen, David N. Jansen
ICTAI
2005
IEEE
14 years 2 months ago
Cellular Ants: Combining Ant-Based Clustering with Cellular Automata
This paper proposes a novel data clustering algorithm, coined ‘cellular ants’, which combines principles of cellular automata and ant colony optimization algorithms to group s...
Andrew Vande Moere, Justin James Clayden