Differences between version 3 and revision by previous author of Heuristic.
Other diffs: Previous Major Revision, Previous Revision, or view the Annotated Edit History
| Newer page: | version 3 | Last edited on Saturday, November 20, 2004 10:38:07 am | by AristotlePagaltzis | Revert |
| Older page: | version 1 | Last edited on Tuesday, November 9, 2004 10:33:00 pm | by StuartYeates | Revert |
@@ -1,3 +1,6 @@
-A heuristic
is a sequence of actions
which usually leads to the right result or an
approximation of the right result. See
also [Algorithm], which
is a sequence of actions which always leads
to the right result
.
+A [Heuristic]
is a step-by-step problem-solving procedure
which usually leads to a sufficiently close
approximation of the right result. Often, a [Heuristic] has the potential to
also deliver very wrong results. [Heuristic]s are used in scenarios where an appropiate
[Algorithm] is either unknown or computationally infeasible
, and occasionally getting bad apples
is an acceptable trade-off
to not solving
the problem at all
.
-[Heuristic]s are used when appropiate
[Algorithm] is unknown, or computationally infeasible
.
+ Of course, this is a heuristic, which is a fancy way of saying that it doesn't work.
+ <br> ''--Mark-Jason Dominus''
+
+Contrast
[Algorithm].
