Probably approximately optimal satisficing strategies

DOI10.1016/0004-3702(95)00010-0OpenAlexW1974328530WikidataQ126807890 ScholiaQ126807890MaRDI QIDQ2674195

Russell Greiner, Pekka Orponen

Publication date: 22 September 2022

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

Full work available at URL: https://doi.org/10.1016/0004-3702(95)00010-0

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

PALO: a probabilistic hill-climbing algorithm ⋮ Learning cost-sensitive active classifiers ⋮ Probably bounded suboptimal heuristic search

Cites Work

• 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
• A theory of the learnable
• Computationally Related Problems
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probably approximately optimal satisficing strategies