Pages that link to "Item:Q2638783"

The following pages link to Dempster's rule of combination is {\#}P-complete (Q2638783):

Displaying 16 items.

• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• A logic-based analysis of Dempster-Shafer theory (Q918733) (← links)
• On the complexity of belief network synthesis and refinement (Q1207964) (← links)
• Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame. (Q1399497) (← links)
• Resource bounded and anytime approximation of belief function computations. (Q1399499) (← links)
• Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study (Q1809376) (← links)
• Measures of uncertainty in expert systems (Q2171255) (← links)
• Depth-bounded belief functions (Q2191247) (← links)
• An evidential similarity-based regression method for the prediction of equipment remaining useful life in presence of incomplete degradation trajectories (Q2328943) (← links)
• Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
• Monte Carlo and quasi-Monte Carlo methods for Dempster's rule of combination (Q2671754) (← links)
• On the hardness of approximate reasoning (Q2674206) (← links)
• Graph decompositions and tree automata in reasoning with uncertainty (Q4286533) (← links)
• Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects (Q4289817) (← links)
• (Q4864282) (← links)
• Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm (Q5227401) (← links)