Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic Petri nets (Q4600564)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding the shortest path in stochastic graphs using learning automata and adaptive stochastic Petri nets |
scientific article; zbMATH DE number 6824680
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8253821730613708
0 references
0.7296104431152344
0 references
0.7199139595031738
0 references
0.7107132077217102
0 references
