Mapping applications of cellular automata into applications of cellular automata networks (Articolo in rivista)

Type
Label
  • Mapping applications of cellular automata into applications of cellular automata networks (Articolo in rivista) (literal)
Anno
  • 2002-01-01T00:00:00+01:00 (literal)
Alternative label
  • Calidonna C.R. 1, Di Gregorio S. 2, Mango Furnari M. 3 (2002)
    Mapping applications of cellular automata into applications of cellular automata networks
    in Computer physics communications
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Calidonna C.R. 1, Di Gregorio S. 2, Mango Furnari M. 3 (literal)
Pagina inizio
  • 724 (literal)
Pagina fine
  • 728 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 147 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • Computer Physics Communication - ISSN 0010-4655 Total Cites (2002) 5007 Impact Factor (2002) 1.204 Immediacy Index 0.220 Articles 313 Cited Half-Life 7.9 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • Si propone una metodologia per tradurre applicazioni, che simulano sistemi complessi, espresse secondo il paradigma ad automi cellulari in applicazioni espresse tramite un paradigma a reti di automi cellulari (CAN) (literal)
Note
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • 1 Istituto di Cibernetica \"E. Caianiello\" C.N.R. Pozzuoli (NA) 2 Dip. di Matematica Università della Calabria, Arcavacata (CS) 3 Istituto di Cibernetica \"E. Caianiello\" C.N.R. Pozzuoli (NA) (literal)
Titolo
  • Mapping applications of cellular automata into applications of cellular automata networks (literal)
Abstract
  • Cellular automata proved to be a promising model to simulate several complex systems: the requirement is that space and time, taken into account, have to be discretisable, while the system to be simulated has to satisfy locality and uniformity in the evolutionary space. Often, in dealing with the simulation of real complex systems some properties of locality are lost and consequently standard CA model application is very difficult. For this reason it is useful to extend the classical CA model and introduce feasible mechanisms in order to take advantage of the parallelism source of this computational model. With this aim the Cellular Automata Network (CAN) model was conceived that includes the advantages of classical CA models and introduces a new source of parallelism, i.e. the network of cellular automata. In this paper we deal with a sort of heuristics in order to map CA applications into CANs. This mapping can also be extremely useful as a proposal of a methodology to drive the modelling and simulation activity of complex phenomena that can be easily fragmented according to local interaction and components. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it