Login / Signup

Two Approximate Dynamic Programming Algorithms for Managing Complete SIS Networks.

Martin PéronPeter L. BartlettKai Helge BeckerKate HelmstedtIadine Chadès
Published in: COMPASS (2018)
Keyphrases
  • dynamic programming algorithms
  • dynamic programming
  • optimal policy
  • np complete problems
  • objective function
  • graph coloring