✦ LIBER ✦

Computation of shortest path in cellular automata

✍ Scribed by A.I. Adamatzky

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 859 KB
Volume: 23
Category: Article
ISSN: 0895-7177
DOI: 10.1016/0895-7177(96)00006-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing k-shortest path lengths in euc

Computing k-shortest path lengths in euclidean networks

✍ Christopher C. Skiscim; Bruce L. Golden 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 496 KB

Computational study of an improved short

Computational study of an improved shortest path algorithm

✍ Fred Glover; Randy Glover; Darwin Klingman 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 649 KB

On the Computational Complexity of Finit

On the Computational Complexity of Finite Cellular Automata

✍ K. Sutner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N

Computer simulation of immunological cel

Computer simulation of immunological cellular automata: The Tsallis model

✍ Matthias Deffner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 347 KB

An efficient pursuit automata approach f

An efficient pursuit automata approach for estimating stable all-pairs shortest paths in stochastic network environments

✍ Sudip Misra; B. John Oommen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 396 KB

An improved watershed algorithm based on

An improved watershed algorithm based on efficient computation of shortest paths

✍ Víctor Osma-Ruiz; Juan I. Godino-Llorente; Nicolás Sáenz-Lechón; Pedro Gómez-Vil 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 402 KB