Login / Signup
Improved Strongly Polynomial Algorithms for Deterministic MDPs, 2VPI Feasibility, and Discounted All-Pairs Shortest Paths.
Adam Karczmarz
Published in:
SODA (2022)
Keyphrases
</>
markov decision processes
genetic algorithm
upper bound
optimization problems
minimum cost flow
neural network
computational complexity
worst case
solution quality