Local Monotonicity in Probabilistic Networks
From MaRDI portal
Publication:3524964
Recommendations
Cites work
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Approximate solution of NP optimization problems
- Completeness in approximation classes
- Fundamental concepts of qualitative probabilistic networks
- Optimization, approximation, and complexity classes
- Scheduling independent tasks to reduce mean finishing time
Cited in
(5)- Disentangling relationships in symptom networks using matrix permutation methods
- Attaining monotonicity for Bayesian networks
- Monotonicity in Bayesian networks for computerized adaptive testing
- The Computational Complexity of Monotonicity in Probabilistic Networks
- Optimal monotone relabelling of partially non-monotone ordinal data
This page was built for publication: Local Monotonicity in Probabilistic Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524964)