Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
From MaRDI portal
Publication:2985109
DOI10.1613/jair.5312zbMath1407.68386OpenAlexW2609269940WikidataQ129489394 ScholiaQ129489394MaRDI QIDQ2985109
Nysret Musliu, Michael Abseher, Stefan Woltran
Publication date: 16 May 2017
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.5312
Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Dynamic programming (90C39)
Related Items (5)
Practical Access to Dynamic Programming on Tree Decompositions ⋮ A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions ⋮ Variable neighborhood search for graphical model energy minimization ⋮ DynASP2.5: Dynamic Programming on Tree Decompositions in Action ⋮ A faster tree-decomposition based algorithm for counting linear extensions
This page was built for publication: Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning
