• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Maximizing the set of recurrent states of an MDP subject to convex constraints.

Eduardo ArveloNuno C. Martins
Published in: Autom. (2014)
Keyphrases
  • convex constraints
  • optimal solution
  • lower bound
  • np hard
  • probability distribution
  • graphical models
  • markov decision processes
  • image denoising
  • finite number