408 citations · 2.6k across the 52 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2014★ 6 cited
Improved bound on the worst case complexity of Policy Iteration
Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne +1
Solving Markov Decision Processes (MDPs) is a recurrent task in engineering. Even though it is known that solutions for minimizing the infinite horizon expected reward can be found…
cs.CC2004★ 45 cited
Decidability and Universality in Symbolic Dynamical Systems
Jean-Charles Delvenne, Petr Kurka, Vincent Blondel
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of universality…