Dynamic threshold P systems with delay on synapses for shortest path problems
From MaRDI portal
Publication:2152438
DOI10.1016/j.tcs.2022.06.008OpenAlexW4281660912WikidataQ114175418 ScholiaQ114175418MaRDI QIDQ2152438
Publication date: 8 July 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.06.008
spiking neural P systemsshortest path problemsdynamic threshold neural P systemsdynamic threshold neural P systems with delay on synapses
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Finding the \(K\) shortest paths in a schedule-based transit network
- Dendrite P systems
- A formal framework for spiking neural P systems
- Spiking neural P systems: matrix representation and formal verification
- A return to stochasticity and probability in spiking neural P systems
- Spiking neural P systems with multiple channels
- Spiking neural P systems with rules on synapses
- A new algorithm for finding the shortest paths using PCNNs
- A discrete-time recurrent neural network for shortest-path routing
- The shortest path computation in MOSPF protocol using an annealed Hopfield neural network with a new cooling schedule
This page was built for publication: Dynamic threshold P systems with delay on synapses for shortest path problems