Differences between version 3 and predecessor to the previous major change of Heuristic.
Other diffs: Previous Revision, Previous Author, 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 2 | Last edited on Wednesday, November 10, 2004 5:09:16 am | by AristotlePagaltzis | Revert |
@@ -1,3 +1,6 @@
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.
+
+ Of course, this is a heuristic, which is a fancy way of saying that it doesn't work.
+ <br> ''--Mark-Jason Dominus''
Contrast [Algorithm].
