Using Four Cost Measures to Determine Arc Reversal Orderings

DOI10.1007/978-3-642-22152-1_10MaRDI QIDQ3011939zbMATH OpenOpenAlexFDO

Authors

Publication date 29 June 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22152-1_10

zbMATH Keywords

arc reversalBayesian networksjoin tree propagation

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Bayesian problems; characterization of Bayes procedures (62C10) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• scientific article; zbMATH DE number 4031432
• Sorting permutations by reversals through branch-and-price
• An algorithm for minimum cost arc-connectivity orientations
• scientific article; zbMATH DE number 957365
• A new reordering method for comprehensive evaluation and its solving algorithm
• Complexity analysis for maximum flow problems with arc reversals
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 2080335
• On performance of quadrant-recursive spatial orders

Cites work

• Bayesian Networks
• Bayesian Networks and Decision Graphs
• Bayesian Networks and Influence Diagrams
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 964356 (Why is no real title available?)
• Join tree propagation with prioritized messages
• Lazy propagation: A junction tree inference algorithm based on lazy evaluation
• Modeling and Reasoning with Bayesian Networks
• Probabilistic graphical models.
• Probabilistic methods for bioinformatics. With an introduction to Bayesian networks.
• The computational complexity of probabilistic inference using Bayesian belief networks

This page was built for publication: Using Four Cost Measures to Determine Arc Reversal Orderings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011939)