Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme

Switch Atlas

Concept

Heuristics

Technique

A heuristic, from the Greek for to find or discover, is in mathematical optimization and computer science a technique designed for problem solving more quickly when classic methods are too slow for finding an exact or approximate solution, or when classic methods fail to find any exact solution in a search space. This is achieved by trading optimality, completeness, accuracy or precision for speed, so a heuristic can be considered a shortcut. A heuristic function, also simply called a heuristic, ranks alternatives in search algorithms at each branching step based on the available information to decide which branch to follow, and it may for example approximate the exact solution. Algorithms recorded in this atlas are grouped here when their design technique is heuristic.

Facts
Core Principle
Usually, but not always, works, giving nearly the right answer. 1
Heuristics
Filter Results4 entries

K-Means Clustering Algorithm

Heuristics

Monte Carlo Tree Search

Heuristics

Sequential Minimal Optimization

Heuristics

Thompson sampling

Heuristics
Connections

In Field

Algorithms and Complexity Theory, Fields

Technique Used By

2-Opt Algorithm, Algorithms
A* Search Algorithm, Algorithms
Ant Colony Optimization Algorithm, Algorithms
Anytime A*, Algorithms
Source Anytime A* (Wikipedia)
APX, Algorithms
Artificial Bee Colony Algorithm, Algorithms
Bat Algorithm, Algorithms
BLAST (Biotechnology), Algorithms
Christofides Algorithm, Algorithms
Contraction Hierarchies Algorithm, Algorithms
Convex Volume Approximation, Algorithms
Coreset, Algorithms
Cuckoo Search Algorithm, Algorithms
DIAMOND (biotechnology), Algorithms
Differential Evolution, Algorithms
Farthest-First Traversal, Algorithms
Firefly Algorithm, Algorithms
Fully polynomial-time approximation scheme, Algorithms
Greedy Randomized Adaptive Search Procedure, Algorithms
Grey Wolf Optimizer, Algorithms
Harmony Search Algorithm, Algorithms
Hill Climbing Algorithm, Algorithms
Iterative Deepening A* Algorithm, Algorithms
K-Approximation of K-Hitting Set, Algorithms
Karloff-Zwick Algorithm, Algorithms
Kernighan-Lin algorithm, Algorithms
K-Means Clustering Algorithm, Algorithms
K-medoids, Algorithms
Source K-medoids (Wikipedia)
Lin-Kernighan Algorithm, Algorithms
Lion Algorithm, Algorithms
Method of Conditional Probabilities, Algorithms
Minimum k-Cut, Algorithms
Monte Carlo Tree Search, Algorithms
Multi-Fragment Algorithm, Algorithms
Neighbor joining, Algorithms
Nelder-Mead Method Algorithm, Algorithms
Parameterized approximation algorithm, Algorithms
Particle Swarm Optimization Algorithm, Algorithms
Polynomial-time approximation scheme, Algorithms
Randomized Rounding, Algorithms
Sequential Minimal Optimization, Algorithms
Source Sequential Minimal Optimization (Wikipedia)
Simulated Annealing Algorithm, Algorithms
SMA*, Algorithms
Source SMA* (Wikipedia)
Submodular set function, Algorithms
Tabu Search Algorithm, Algorithms
Thompson sampling, Algorithms
Source Thompson sampling (Wikipedia)
Variable Neighborhood Search, Algorithms
Vertex k-Center Problem, Algorithms
Whale Optimization Algorithm, Algorithms
Ziegler-Nichols method, Algorithms
Source Ziegler-Nichols method (Wikipedia)
Sources
1. NIST DADS: heuristic
Definition
Quote, Definition
An algorithm that usually, but not always, works or that gives nearly the right answer.
View the Source
Wikipedia: Heuristic (computer science)
  • Wikipedia, lead section
    This is achieved by trading optimality, completeness, accuracy, or precision for speed.
  • In Group: Algorithm Design Strategies, Lead
    In mathematical optimization and computer science, heuristic (from Greek εὑρίσκω eurísko "I find, discover") is a technique designed for problem solving more quickly when classic methods are too slow for finding an exact or approximate solution, or when classic methods fail to find any exact solution in a search space.
View the Source
Sequential Minimal Optimization (Wikipedia)
Technique Used By: Sequential Minimal Optimization, Article body
Quote, Technique Used By: Sequential Minimal Optimization, Article body
Although this algorithm is guaranteed to converge, heuristics are used to choose the pair of multipliers so as to accelerate the rate of convergence.
View the Source
Thompson sampling (Wikipedia)
Technique Used By: Thompson sampling, Lead paragraph
Quote, Technique Used By: Thompson sampling, Lead paragraph
is a heuristic for choosing actions
View the Source
SMA* (Wikipedia)
Technique Used By: SMA*, Properties
Quote, Technique Used By: SMA*, Properties
It works with a heuristic, just as A*
View the Source
K-medoids (Wikipedia)
Technique Used By: K-medoids, Algorithms
Quote, Technique Used By: K-medoids, Algorithms
multiple heuristics to optimize this problem exist
View the Source
Anytime A* (Wikipedia)
Technique Used By: Anytime A*, Background and history
Quote, Technique Used By: Anytime A*, Background and history
A*'s optimality can be sacrificed in order to reduce the execution time by inflating the heuristic, as in weighted A* from 1970.
View the Source
Ziegler-Nichols method (Wikipedia)
Technique Used By: Ziegler-Nichols method, Lead
Quote, Technique Used By: Ziegler-Nichols method, Lead
is a heuristic method of tuning a PID controller
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.