Searching for the m best solutions in graphical models
DOI10.1613/JAIR.4985zbMATH Open1352.68221OpenAlexW2341646523WikidataQ129489422 ScholiaQ129489422MaRDI QIDQ2800960FDOQ2800960
Authors: Natalia Flerova, Radu Marinescu, Rina Dechter 
Publication date: 19 April 2016
Published in: The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4985
Recommendations
- scientific article; zbMATH DE number 1894279
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Finding models through graph saturation
- Searching for a source of difference in graphical models
- Discrete graphical models -- an optimization perspective
- scientific article; zbMATH DE number 802829
- scientific article; zbMATH DE number 898050
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Cited In (6)
- Heuristic search for one-to-many shortest path queries
- Finding Best k Policies
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
- Searching for a source of difference in graphical models
- AND/OR search spaces for graphical models
- Chordal Graphs to Identify Graphical Model Solutions of Maximum of Entropy Under Constraints on Marginals
This page was built for publication: Searching for the \(m\) best solutions in graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800960)
