Local Monotonicity in Probabilistic Networks
From MaRDI portal
Publication:3524964
DOI10.1007/978-3-540-75256-1_49zbMATH Open1148.68523OpenAlexW1758545165MaRDI QIDQ3524964FDOQ3524964
Authors: Johan Kwisthout, Gerard Tel, Hans L. Bodlaender
Publication date: 16 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75256-1_49
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization, approximation, and complexity classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling independent tasks to reduce mean finishing time
- Approximate solution of NP optimization problems
- Completeness in approximation classes
- Fundamental concepts of qualitative probabilistic networks
Cited In (5)
- The Computational Complexity of Monotonicity in Probabilistic Networks
- Disentangling relationships in symptom networks using matrix permutation methods
- Attaining monotonicity for Bayesian networks
- Monotonicity in Bayesian networks for computerized adaptive testing
- 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)