Sciweavers

1246 search results - page 111 / 250
» Recursive Timed Automata
Sort
View
161
Voted
BIOCOMP
2009
15 years 2 months ago
Simulating Spatial Partial Differential Equations with Cellular Automata
Abstract-- Spatial partial differential equations are commonly used to describe systems of biological entities, such as patterns created by desert vegetation and biovermiculation g...
Brian Strader, Keith E. Schubert, Ernesto Gomez, J...
FOSSACS
2004
Springer
15 years 10 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
DAC
2004
ACM
16 years 6 months ago
Quantum-Dot Cellular Automata (QCA) circuit partitioning: problem modeling and solutions
This paper presents the Quantum-Dot Cellular Automata (QCA) physical design problem, in the context of the VLSI physical design problem. The problem is divided into three subprobl...
Dominic A. Antonelli, Danny Z. Chen, Timothy J. Dy...
133
Voted
STACS
2010
Springer
16 years 11 hour ago
Ultimate Traces of Cellular Automata
A cellular automaton (CA) is a parallel synchronous computing model, which consists in a juxtaposition of finite automata (cells) whose state evolves according to that of their ne...
Julien Cervelle, Enrico Formenti, Pierre Guillon
ACRI
2006
Springer
15 years 11 months ago
Directed Percolation Phenomena in Asynchronous Elementary Cellular Automata
Cellular automata are discrete dynamical systems that are widely used to model natural systems. Classically they are run with perfect synchrony ; i.e., the local rule is applied to...
Nazim Fatès