Login / Signup
Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning.
Michael Abseher
Frederico Dusberger
Nysret Musliu
Stefan Woltran
Published in:
IJCAI (2015)
Keyphrases
</>
machine learning
dynamic programming
tree decompositions
artificial intelligence
constraint satisfaction problems
state space
reinforcement learning
computational complexity
database
databases
lower bound
query processing
np hard
constraint satisfaction
graph theory