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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:146054bfdbf4 · see in the full table