Fast local search methods for solving limited memory influence diagrams (Q895537): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q62046524 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ElemStatLearn / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hailfinder / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: k-Neighborhood / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ijar.2015.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W341277852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Networks and Expert Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Networks and Decision Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing and Solving Decision Problems with Limited Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Limited Memory Influence Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximate reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming and influence diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational theory of decision networks / rank
 
Normal rank

Latest revision as of 03:21, 11 July 2024

scientific article
Language Label Description Also known as
English
Fast local search methods for solving limited memory influence diagrams
scientific article

    Statements

    Fast local search methods for solving limited memory influence diagrams (English)
    0 references
    3 December 2015
    0 references
    influence diagrams
    0 references
    probabilistic graphical models
    0 references
    decision making
    0 references
    local search
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references

    Identifiers