Encyclopedia > Heuristics

  Article Content

Heuristic

Redirected from Heuristics

In computer science, a heuristic is an algorithm or procedure designed to solve a problem that ignores whether the solution is probably correct, but which usually produces a good solution or solves a simpler problem that contains or intersects with the solution of the more complex problem.

A heuristic is not guaranteed always to solve the problem, but often solves it well enough for most uses, and often does so more quickly than a more complete solution would.



All Wikipedia text is available under the terms of the GNU Free Documentation License

 
  Search Encyclopedia

Search over one million articles, find something about almost anything!
 
 
  
  Featured Article
Dynabee

... fast enough, for example after starting it with a short rip string or by a snap of the thumb, a person holding it in her hand can accelerate the gyroscope to incredibly ...

 
 
 
This page was created in 25 ms