Finding the Shortest Path in Stochastic Graphs Using Learning Automata and Adaptive Stochastic Petri Nets (Q4600564): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0218488517500180 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2617189554 / rank | |||
Normal rank | |||
Latest revision as of 08:47, 30 July 2024
scientific article; zbMATH DE number 6824680
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the Shortest Path in Stochastic Graphs Using Learning Automata and Adaptive Stochastic Petri Nets |
scientific article; zbMATH DE number 6824680 |
Statements
Finding the Shortest Path in Stochastic Graphs Using Learning Automata and Adaptive Stochastic Petri Nets (English)
0 references
11 January 2018
0 references
stochastic graphs
0 references
shortest path problem
0 references
learning automata
0 references
adaptive stochastic Petri net based on learning automata
0 references
