Home  »     »   Heuristic (Computer Science)
ALL 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Heuristic (Computer Science)

Posted: January 16, 2022 | by Site Host

Heuristic in mathematical optimization and computer science is a technique designed for solving problems faster when classic methods are too slow or for finding an approximate solution when classic methods fail to find any exact solution. Heuristic takes a shortcut by trading optimality, completeness, accuracy, or precision for speed.

Found this article interesting? Follow Brightwhiz on Facebook, Twitter, and YouTube to read and watch more content we post.

Share it!