An axiomatic framework for influence diagram computation with partially ordered preferences (Q2206449): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2020.06.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3041053855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5571447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Networks and Decision Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative probabilities for default reasoning, belief revision, and causal modeling / 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: A note about redundancy in influence diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enabling local computation for partially ordered preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fusion and propagation with multiple observations in belief networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuation-Based Systems for Bayesian Decision Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valuation network representation and solution of asymmetric decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential decision making with partially ordered preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Credal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered valuation algebras: A generic framework for approximating inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Limited Memory Influence Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating credal networks is approximable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Influence diagrams with super value nodes involving imprecise information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results and algorithms for possibilistic influence diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating interval-valued influence diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: AND/OR branch-and-bound search for combinatorial optimization in graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory intensive AND/OR search for combinatorial optimization in graphical models / rank
 
Normal rank

Latest revision as of 22:01, 23 July 2024

scientific article
Language Label Description Also known as
English
An axiomatic framework for influence diagram computation with partially ordered preferences
scientific article

    Statements

    An axiomatic framework for influence diagram computation with partially ordered preferences (English)
    0 references
    0 references
    0 references
    22 October 2020
    0 references
    influence diagrams
    0 references
    variable elimination
    0 references
    preferences
    0 references
    uncertainty
    0 references
    utility
    0 references
    optimization
    0 references

    Identifiers