Finding optimal satisficing strategies for and-or trees

DOI10.1016/j.artint.2005.09.002zbMath1131.68524OpenAlexW2058792175MaRDI QIDQ2457646

Yanyan Li

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2005.09.002

zbMATH Keywords

computational complexitydiagnosisand-or treesatisficing search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Sequential testing in batches ⋮ A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems ⋮ A General Framework for Approximating Min Sum Ordering Problems ⋮ Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ The eigen-distribution for multi-branching weighted trees on independent distributions ⋮ Adaptivity gaps for the stochastic Boolean function evaluation problem ⋮ Unnamed Item ⋮ Evaluation of monotone DNF formulas ⋮ Algorithms for the unit-cost stochastic score classification problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomized vs. deterministic decision tree complexity for read-once Boolean functions
• Query strategies for priced information
• Controlling backward inference
• Finding optimal derivation strategies in redundant knowledge bases
• Optimal problem-solving search: All-or-none solutions
• Optimal task sequencing with precedence constraints
• Richard Bellman on the Birth of Dynamic Programming
• Optimal Search on Some Game Trees
• Computationally Related Problems

This page was built for publication: Finding optimal satisficing strategies for and-or trees