Which algorithm is used to find the shortest path in a Markov Decision Process?
a) Bellman-Ford
b) Simplex
c) Dijkstra's
d) Value Iteration
Welcome!
This community is for professionals and enthusiasts of our products and services.
Share and discuss the best content and new marketing ideas, build your professional profile and become a better marketer together.
This question has been flagged
62
Views
