Sciweavers

269 search results - page 35 / 54
» Computing with Probabilistic Cellular Automata
Sort
View
ISVLSI
2003
IEEE
138views VLSI» more  ISVLSI 2003»
14 years 1 months ago
Bouncing Threads: Merging a New Execution Model into a Nanotechnology Memory
The need for small, high speed, low power computers as the end of Moore’s law approaches is driving research into nanotechnology. These novel devices have significantly differe...
Sarah E. Frost, Arun Rodrigues, Charles A. Giefer,...
ASPDAC
2005
ACM
92views Hardware» more  ASPDAC 2005»
13 years 10 months ago
Partitioning and placement for buildable QCA circuits
— Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chem...
Ramprasad Ravichandran, Michael T. Niemier, Sung K...
FORMATS
2009
Springer
14 years 14 days ago
Stochastic Games for Verification of Probabilistic Timed Automata
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
VLSID
2003
IEEE
208views VLSI» more  VLSID 2003»
14 years 1 months ago
Cryptosystem Designed for Embedded System Security
— This paper reports a cryptosystem designed for security of embedded systems. It is based on the theory of Cellular Automata(CA). The Cellular Automata based Cryptosystem(CAC) e...
Subhayan Sen, Sk. Iqbal Hossain, Kabirul Islam, Di...
QEST
2008
IEEE
14 years 3 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...