Login / Signup

Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning.

Michael AbseherNysret MusliuStefan Woltran
Published in: J. Artif. Intell. Res. (2017)
Keyphrases
  • machine learning
  • dynamic programming
  • tree decompositions
  • constraint satisfaction problems
  • reinforcement learning
  • database
  • databases
  • lower bound
  • state space
  • single machine