Pages that link to "Item:Q2440184"
From MaRDI portal
The following pages link to Decision-theoretic troubleshooting: hardness of approximation (Q2440184):
Displaying 8 items.
- Scheduling results applicable to decision-theoretic troubleshooting (Q473374) (← links)
- The hardness of the expected decision depth problem (Q845910) (← links)
- Troubleshooting using probabilistic networks and value of information (Q1347871) (← links)
- Troubleshooting: NP-hardness and solution methods (Q1762607) (← links)
- Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints (Q3011946) (← links)
- Complexity of decision-theoretic troubleshooting (Q4416292) (← links)
- (Q4518872) (← links)
- About the choice of the variable to unassign in a decision repair algorithm (Q5710543) (← links)