Searching for the M Best Solutions in Graphical Models
From MaRDI portal
Publication:2800960
DOI10.1613/JAIR.4985zbMath1352.68221OpenAlexW2341646523WikidataQ129489422 ScholiaQ129489422MaRDI QIDQ2800960
Natalia Flerova, Radu Marinescu, Rina Dechter
Publication date: 19 April 2016
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4985
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Heuristic search for one-to-many shortest path queries ⋮ Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
This page was built for publication: Searching for the M Best Solutions in Graphical Models
