scientific article; zbMATH DE number 19871

zbMATH Open0742.68074MaRDI QIDQ3979382FDOQ3979382

Authors: D. Einav, M. R. Fehling 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Optimal search with positive switch cost is NP-hard
• scientific article; zbMATH DE number 3850820
• scientific article; zbMATH DE number 431475
• Scheduling of resource tasks
• Optimal sequential backup strategy under constrained resources

zbMATH Keywords

optimal strategy\(NP\)-complete

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cited In (2)

• Deliberation scheduling for problem solving in time-constrained environments
• Monitoring and control of anytime algorithms: A dynamic programming approach

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979382)