Sciweavers

84 search results - page 10 / 17
» The Computational Power of Benenson Automata
Sort
View
ISVLSI
2003
IEEE
138views VLSI» more  ISVLSI 2003»
15 years 2 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,...
73
Voted
CORR
2007
Springer
100views Education» more  CORR 2007»
14 years 9 months ago
Interference Automata
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...
M. V. Panduranga Rao
ET
2007
61views more  ET 2007»
14 years 9 months ago
Reliability and Defect Tolerance in Metallic Quantum-dot Cellular Automata
The computational paradigm known as quantum-dot cellular automata (QCA) encodes binary information in the charge configuration of Coulomb-coupled quantum-dot cells. Functioning QC...
Mo Liu, Craig S. Lent
CONCUR
2005
Springer
15 years 3 months ago
A New Modality for Almost Everywhere Properties in Timed Automata
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
Houda Bel Mokadem, Béatrice Bérard, ...
COGSCI
2010
160views more  COGSCI 2010»
14 years 9 months ago
Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
Jakub Szymanik, Marcin Zajenkowski