Physarum Can Compute Shortest Paths (Articolo in rivista)

Type
Label
  • Physarum Can Compute Shortest Paths (Articolo in rivista) (literal)
Anno
  • 2012-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1016/j.jtbi.2012.06.017 (literal)
Alternative label
  • Bonifaci V.; Mehlhorn K.; Varma G. (2012)
    Physarum Can Compute Shortest Paths
    in Journal of theoretical biology
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Bonifaci V.; Mehlhorn K.; Varma G. (literal)
Pagina inizio
  • 121 (literal)
Pagina fine
  • 133 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 309 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#pagineTotali
  • 13 (literal)
Note
  • Scopu (literal)
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Istituto di Analisi dei Sistemi ed Informatica - CNR, Rome, Italy Max-Planck-Institut fuer Informatik, Saarbruecken, Germany Tata Institute for Fundamental Research, Mumbai, India (literal)
Titolo
  • Physarum Can Compute Shortest Paths (literal)
Abstract
  • Physarum polycephalum is a slime mold that is apparently able to solve shortest path problems. A mathematical model has been proposed by Tero, Kobayashi and Nakagaki [Journal of Theoretical Biology, 244, 2007, pp. 553--564] to describe the feedback mechanism used by the slime mold to adapt its tubular channels while foraging two food sources s0 and s1. We prove that, under this model, the mass of the mold will eventually converge to the shortest s0-s1 path of the network that the mold lies on, independently of the structure of the network or of the initial mass distribution. This matches the experimental observations by Tero et al. and can be seen as an example of a \"natural algorithm\", that is, an algorithm developed by evolution over millions of years. (literal)
Prodotto di
Autore CNR

Incoming links:


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