Decision-theoretic troubleshooting: hardness of approximation (Q2440184): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104625216 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.6551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision trees for entity identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of probabilistic inference using Bayesian belief networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating min sum set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Troubleshooting using probabilistic networks and value of information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing optimal binary decision trees is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The SACSO methodology for troubleshooting complex systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning with attribute costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database Theory - ICDT 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of decision-theoretic troubleshooting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Troubleshooting: NP-hardness and solution methods / rank
 
Normal rank

Latest revision as of 13:14, 7 July 2024

scientific article
Language Label Description Also known as
English
Decision-theoretic troubleshooting: hardness of approximation
scientific article

    Statements

    Identifiers