Heuristic - Computer Science

Computer Science

In computer science, a heuristic is a technique designed for solving a problem quicker when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution. By trading optimality, completeness, accuracy, and/or precision for speed, a heuristic can quickly produce a solution that is good enough for solving the problem at hand, as opposed to finding all exact solutions in a prohibitively long time.

For example, many real-time anti-virus scanners use heuristic signatures for detecting viruses and other forms of malware.

One way of achieving this computational performance gain consists in solving a simpler problem whose solution is also a solution to the more complex problem. See the main article for more details.

Read more about this topic:  Heuristic

Famous quotes containing the words computer and/or science:

    “The Buddha, the Godhead, resides quite as comfortably in the circuits of a digital computer or the gears of a cycle transmission as he does at the top of a mountain or in the petals of a flower.”
    —Robert M. Pirsig (b. 1928)

    “Human Nature is the only science of man; and yet has been hitherto the most neglected.”
    —David Hume (1711–1776)