Sciweavers

84 search results - page 8 / 17
» The Computational Power of Benenson Automata
Sort
View
ARITH
2007
IEEE
14 years 5 months ago
Serial Parallel Multiplier Design in Quantum-dot Cellular Automata
An emerging nanotechnology, quantum-dot cellular automata (QCA), has the potential for attractive features such as faster speed, smaller size, and lower power consumption than tra...
Heumpil Cho, Earl E. Swartzlander Jr.
LICS
1998
IEEE
14 years 2 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
MFCS
2005
Springer
14 years 4 months ago
Concurrent Automata vs. Asynchronous Systems
We compare the expressive power of two automata-based finite-state models of concurrency. We show that Droste’s and Kuske’s coherent stably concurrent automata and Bednarczyk...
Rémi Morin
WCE
2007
14 years 1 days ago
Adaptive Automata Community Detection and Clustering: A generic methodology
— We present in this paper a generic methodology based on genetic automata for modelling community detection. With Communities, we deal with dynamic organizations which are self-...
Rawan Ghnemat, Cyrille Bertelle, Gérard Hen...
PDPTA
2010
13 years 8 months ago
Data-Parallelism and GPUs for Lattice Gas Fluid Simulations
Lattice gas cellular automata (LGCA) models provide a relatively fast means of simulating fluid flow and can give both quantitative and qualitative insights into flow patterns aro...
Mitchel Johnson, Daniel P. Playne, Kenneth A. Hawi...