Examples of Heuristics in Computer Science
The post Examples of Heuristics in Computer Science first appeared on Qvault . Heuristics in computer science and artificial intelligence are “rules of thumb” that are used in algorithms to assist in finding approximate solutions for complex problems. Often, there is simply too much data to sift through in order to come to a solution in a timely manner, and so, a heuristic algorithm is used to trade exactness for speed. However, because heuristics are based on individual rules unique to the problem they are solving, the specifics of the heuristics vary from problem to problem. Example problems and their heuristics are given below. Traveling Salesperson Problem (TSP) The TSP is a famous algorithm with a Big-O of O(n!) and asks the question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city? For a low number of cities, this question could be reasonably brute-forced. Ho...