Sciweavers

620 search results - page 55 / 124
» Algorithms and computations on cellular automata
Sort
View
TACAS
2009
Springer
115views Algorithms» more  TACAS 2009»
15 years 7 months ago
Iterating Octagons
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
Marius Bozga, Codruta Gîrlea, Radu Iosif
MOBIHOC
2003
ACM
15 years 5 months ago
Mobility modelling and trajectory prediction for cellular networks with mobile base stations
This paper provides mobility estimation and prediction for a variant of GSM network which resembles an adhoc wireless mobile network where base stations and users are both mobile....
Pubudu N. Pathirana, Andrey V. Savkin, Sanjay Jha
116
Voted
DATE
2006
IEEE
103views Hardware» more  DATE 2006»
15 years 6 months ago
Novel designs for thermally robust coplanar crossing in QCA
In this paper, different circuit arrangements of Quantumdot Cellular Automata (QCA) are proposed for the so-called coplanar crossing. These arrangements exploit the majority votin...
Sanjukta Bhanja, Marco Ottavi, Fabrizio Lombardi, ...
122
Voted
ACRI
2004
Springer
15 years 6 months ago
Applying Cell-DEVS in 3D Free-Form Shape Modeling
Modeling free-form shapes in 3D spaces based on strict physical laws require a considerable amount of computation time. Previous experiences with Cellular Automata demonstrated sub...
Pengfei Wu, Xiuping Wu, Gabriel A. Wainer
DSD
2005
IEEE
96views Hardware» more  DSD 2005»
15 years 2 months ago
Improvement of the Fault Coverage of the Pseudo-Random Phase in Column-Matching BIST
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...
Peter Filter, Hana Kubatova