Difference between revisions of "Heuristic"
Jump to navigation
Jump to search
m |
|||
| Line 2: | Line 2: | ||
Heuristic [[algorithm]]s and processes are ones which, although they might not come up with the optimal solution, demonstrably result in a fairly good/accurate one. | Heuristic [[algorithm]]s and processes are ones which, although they might not come up with the optimal solution, demonstrably result in a fairly good/accurate one. | ||
| + | |||
| + | ==See also== | ||
| + | *[[Affect heuristic]] | ||
==References== | ==References== | ||
Revision as of 16:37, September 2, 2014
A heuristic approach is an informal method of solving a problem. Sometimes this is accomplished through logical reasoning, experimental techniques, or trial-and-error.[1]
Heuristic algorithms and processes are ones which, although they might not come up with the optimal solution, demonstrably result in a fairly good/accurate one.