Heuristic Rule

From GM-RKB
(Redirected from heuristic rule)
Jump to: navigation, search

A Heuristic Rule is a rule that is intended to achieve an approximate solution.



References

2021

2014

  • (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/heuristic Retrieved:2014-1-7.
    • Heuristic ( /hyʉˈrɪstɪk/; Greek: "Εὑρίσκω", "find" or "discover") refers to experience-based techniques for problem solving, learning, and discovery that give a solution which is not guaranteed to be optimal. Where the exhaustive search is impractical, heuristic methods are used to speed up the process of finding a satisfactory solution via mental shortcuts to ease the cognitive load of making a decision. Examples of this method include using a rule of thumb, an educated guess, an intuitive judgment, stereotyping, or common sense.

      In more precise terms, heuristics are strategies using readily accessible, though loosely applicable, information to control problem solving in human beings and machines. [1]

  1. Pearl, Judea (1983). Heuristics: Intelligent Search Strategies for Computer Problem Solving. New York, Addison-Wesley, p. vii. ISBN 978-0-201-05594-8