In mathematical optimization and computer science, heuristic (from Greek εὑρίσκω “I find, discover”) is a technique designed for problem solving more quickly when classic methods are too slow for finding an exact or approximate solution, or when classic methods fail to find any exact solution in a search space. This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut. [1]
Heuristic
In mathematical optimization and computer science, heuristic (from Greek εὑρίσκω “I find, discove...
There are currently no comments on this article, be the first to comment below!
Add a Comment
Please be respectful! Comments may be removed at any time. 🧑⚖️