4 citations · 20 across the 27 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.FL2018
On the Complexity of Value Iteration
Nikhil Balaji, Stefan Kiefer, Petr Novotný +2
Value iteration is a fundamental algorithm for solving Markov Decision Processes (MDPs). It computes the maximal -step payoff by iterating times a recurrence equation which…
cs.LO2018
Costs and Rewards in Priced Timed Automata
Martin Fränzle, Mahsa Shirmohammadi, Mani Swaminathan +1
We consider Pareto analysis of reachable states of multi-priced timed automata (MPTA): timed automata equipped with multiple observers that keep track of costs (to be minimised) an…