View source for Heuristic (computer science)

In [[computer science]], [[artificial intelligence]], and [[mathematical optimization]], a '''heuristic''' is a technique designed for solving a problem more quickly when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution.

== Description ==

This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut.

A heuristic function, also called simply a heuristic, is a function that ranks alternatives in search algorithms at each branching step based on available information to decide which branch to follow. For example, it may approximate the exact solution.

== See also ==

* [[Algorithm]]
* [[Artificial intelligence]]
* [[Constructive heuristic]]
* [[Genetic algorithm]]
* [[Heuristic]]
* [[Heuristic routing]]
* [[Heuristic evaluation]]: Method for identifying usability problems in user interfaces.
* [[Metaheuristic]]: Methods for controlling and tuning basic heuristic algorithms, usually with usage of memory and learning.
* [[Matheuristics]]: Optimization algorithms made by the interoperation of metaheuristics and mathematical programming (MP) techniques.
Reactive search optimization: Methods using online [[machine learning]] principles for self-tuning of heuristics.

== External links ==

* [https://en.wikipedia.org/wiki/Heuristic_(computer_science) Heuristic (computer science)]]


[[Category:Artificial intelligence]]
[[Category:Computer science]]