Heuristics¶
Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Algorithm
- A common failure is treating a heuristic as a correct algorithm, assuming guarantees it does not have, then being surprised by edge-case failures
This sourceFoundational study formalizing heuristics as strategies that guide search along promising paths but may yield suboptimal solutions or fail to terminate
- A common failure is treating a heuristic as a correct algorithm, assuming guarantees it does not have, then being surprised by edge-case failures
- Heuristic
- A method qualifies as a heuristic when each of the following holds:
This sourceFoundational study formalizing heuristics as procedures that sacrifice guaranteed optimality or termination for empirical performance, sharply distinguishing them from algorithms with provable guarantees.
- A method qualifies as a heuristic when each of the following holds:
Verification¶
Does it exist? Not confirmed. The DOI recorded for this work did not resolve when it was last checked, so it is shown above but not linked. The citation may still be sound; the recorded identifier is not. Flagged for repair.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:146054bfdbf4 · see in the full table