Optimal problem-solving search: All-or-none solutions
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3347627 (Why is no real title available?)
- scientific article; zbMATH DE number 3407200 (Why is no real title available?)
- scientific article; zbMATH DE number 3415384 (Why is no real title available?)
- An admissible and optimal algorithm for searching AND/OR graphs
- Optimal task sequencing with precedence constraints
- Quiz show problems
Cited in
(14)- Deliberation scheduling for problem solving in time-constrained environments
- Testing systems of identical components
- Controlling backward inference
- Finding optimal derivation strategies in redundant knowledge bases
- Sequential testing of complex systems: a review
- A polynomial-time approximation scheme for sequential batch testing of series systems
- Finding optimal satisficing strategies for and-or trees
- Can diverse and conflicting interests of multiple stakeholders be balanced?
- Ordering conjunctive queries
- Embedding decision-analytic control in a learning architecture
- PALO: a probabilistic hill-climbing algorithm
- Proof-number search
- Probably approximately optimal satisficing strategies
- Computer science and decision theory
This page was built for publication: Optimal problem-solving search: All-or-none solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1226866)