Sciweavers

1279 search results - page 11 / 256
» Fast Implementations of Automata Computations
Sort
View
BMCBI
2004
121views more  BMCBI 2004»
13 years 7 months ago
Asynchronous adaptive time step in quantitative cellular automata modeling
Background: The behaviors of cells in metazoans are context dependent, thus large-scale multicellular modeling is often necessary, for which cellular automata are natural candidat...
Hao Zhu, Peter Y. H. Pang, Yan Sun, Pawan Dhar
ISMM
2009
Springer
14 years 2 months ago
Fast Implementation of the Ultimate Opening
Abstract. We present an efficient implementation of the ultimate attribute opening operator. In this implementation, the ultimate opening is computed by processing the image maxtre...
Jonathan Fabrizio, Beatriz Marcotegui
CF
2007
ACM
13 years 11 months ago
General floorplan for reversible quantum-dot cellular automata
This paper presents the Collapsed Bennett Layout, a general purpose floorplan for reversible quantum-dot cellular automata (QCA) circuits. In order to exploit the full density and...
Sarah E. Murphy, Erik DeBenedictis, Peter M. Kogge
IPOM
2005
Springer
14 years 1 months ago
Evaluation of the Fast Handover Implementation for Mobile IPv6 in a Real Testbed
Abstract. Fast Handovers is an enhancement to the Mobile IPv6 protocol, currently specified in an IETF draft, which reduces the handover latency. This can be beneficial to real-t...
Albert Cabellos-Aparicio, Jose Núñez...
OPODIS
2010
13 years 5 months ago
On the Automated Implementation of Time-Based Paxos Using the IOA Compiler
Paxos is a well known algorithm for achieving consensus in distributed environments with uncertain processing and communication timing. Implementations of its variants have been s...
Chryssis Georgiou, Procopis Hadjiprocopiou, Peter ...