Difference between revisions of "Heuristic (computer science)"

From Wiki @ Karl Jones dot com
Jump to: navigation, search
(Created page with "In computer science, artificial intelligence, and mathematical optimization, a '''heuristic''' is a technique designed for solving a problem more quickly when clas...")
 
(External links)
 
Line 22: Line 22:
 
== External links ==
 
== External links ==
  
* [https://en.wikipedia.org/wiki/Heuristic_(computer_science) Heuristic (computer science)]]
+
* [https://en.wikipedia.org/wiki/Heuristic_(computer_science) Heuristic (computer science)] @ Wikipedia
  
  
 
[[Category:Artificial intelligence]]
 
[[Category:Artificial intelligence]]
 
[[Category:Computer science]]
 
[[Category:Computer science]]

Latest revision as of 10:59, 29 August 2016

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

Reactive search optimization: Methods using online machine learning principles for self-tuning of heuristics.

External links