Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks (Q881799): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q57551191 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ijar.2006.07.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016619340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing probability intervals with simulated annealing and probability trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using probability trees to compute marginals with imprecise probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Credal networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical models for imprecise probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5753553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4408097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Information and Sufficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong conditional independence for credal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval probability propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999364 / rank
 
Normal rank

Latest revision as of 19:33, 25 June 2024

scientific article
Language Label Description Also known as
English
Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
scientific article

    Statements

    Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks (English)
    0 references
    0 references
    18 May 2007
    0 references
    0 references
    credal network
    0 references
    probability intervals
    0 references
    Bayesian networks
    0 references
    strong independence
    0 references
    hill-climbing
    0 references
    branch-and-bound algorithms
    0 references
    0 references
    0 references