Local Monotonicity in Probabilistic Networks

DOI10.1007/978-3-540-75256-1_49zbMath1148.68523OpenAlexW1758545165MaRDI QIDQ3524964

Gerard Tel, Johan Kwisthout, 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

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate solution of NP optimization problems
• Completeness in approximation classes
• Optimization, approximation, and complexity classes
• Fundamental concepts of qualitative probabilistic networks
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: Local Monotonicity in Probabilistic Networks