Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Heuristic (computer science)

Index Heuristic (computer science)

In computer science, artificial intelligence, and mathematical optimization, a heuristic (from Greek εὑρίσκω "I find, discover") is a technique designed for solving a problem more quickly when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution. [1]

34 relations: Accuracy and precision, Admissible heuristic, Algorithm, Allen Newell, Alpha–beta pruning, Artificial intelligence, Computer science, Constructive heuristic, Function (mathematics), Genetic algorithm, Greedy algorithm, Greek language, Herbert A. Simon, Heuristic, Heuristic evaluation, Heuristic routing, Jon Bentley (computer scientist), Knapsack problem, Machine learning, Mathematical optimization, Matheuristics, Metaheuristic, NP-completeness, NP-hardness, Overfitting, Plotter, Problem solving, Rule of thumb, Search algorithm, Search problem, Statistics, Travelling salesman problem, Turing Award, Usability.

Accuracy and precision

Precision is a description of random errors, a measure of statistical variability.

New!!: Heuristic (computer science) and Accuracy and precision · See more »

Admissible heuristic

In computer science, specifically in algorithms related to pathfinding, a heuristic function is said to be admissible if it never overestimates the cost of reaching the goal, i.e. the cost it estimates to reach the goal is not higher than the lowest possible cost from the current point in the path.

New!!: Heuristic (computer science) and Admissible heuristic · See more »

Algorithm

In mathematics and computer science, an algorithm is an unambiguous specification of how to solve a class of problems.

New!!: Heuristic (computer science) and Algorithm · See more »

Allen Newell

Allen Newell (March 19, 1927 – July 19, 1992) was a researcher in computer science and cognitive psychology at the RAND Corporation and at Carnegie Mellon University’s School of Computer Science, Tepper School of Business, and Department of Psychology.

New!!: Heuristic (computer science) and Allen Newell · See more »

Alpha–beta pruning

Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.

New!!: Heuristic (computer science) and Alpha–beta pruning · See more »

Artificial intelligence

Artificial intelligence (AI, also machine intelligence, MI) is intelligence demonstrated by machines, in contrast to the natural intelligence (NI) displayed by humans and other animals.

New!!: Heuristic (computer science) and Artificial intelligence · See more »

Computer science

Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.

New!!: Heuristic (computer science) and Computer science · See more »

Constructive heuristic

A constructive heuristic is a type of heuristic method which starts with an empty solution and repeatedly extends the current solution until a complete solution is obtained.

New!!: Heuristic (computer science) and Constructive heuristic · See more »

Function (mathematics)

In mathematics, a function was originally the idealization of how a varying quantity depends on another quantity.

New!!: Heuristic (computer science) and Function (mathematics) · See more »

Genetic algorithm

In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA).

New!!: Heuristic (computer science) and Genetic algorithm · See more »

Greedy algorithm

A greedy algorithm is an algorithmic paradigm that follows the problem solving heuristic of making the locally optimal choice at each stage with the intent of finding a global optimum.

New!!: Heuristic (computer science) and Greedy algorithm · See more »

Greek language

Greek (Modern Greek: ελληνικά, elliniká, "Greek", ελληνική γλώσσα, ellinikí glóssa, "Greek language") is an independent branch of the Indo-European family of languages, native to Greece and other parts of the Eastern Mediterranean and the Black Sea.

New!!: Heuristic (computer science) and Greek language · See more »

Herbert A. Simon

Herbert Alexander Simon (June 15, 1916 – February 9, 2001) was an American economist and political scientist whose primary interest was decision-making within organizations and is best known for the theories of "bounded rationality" and "satisficing".

New!!: Heuristic (computer science) and Herbert A. Simon · See more »

Heuristic

A heuristic technique (εὑρίσκω, "find" or "discover"), often called simply a heuristic, is any approach to problem solving, learning, or discovery that employs a practical method, not guaranteed to be optimal, perfect, logical, or rational, but instead sufficient for reaching an immediate goal.

New!!: Heuristic (computer science) and Heuristic · See more »

Heuristic evaluation

A heuristic evaluation is a usability inspection method for computer software that helps to identify usability problems in the user interface (UI) design.

New!!: Heuristic (computer science) and Heuristic evaluation · See more »

Heuristic routing

Heuristic routing is a system used to describe how deliveries are made when problems in a network topology arise.

New!!: Heuristic (computer science) and Heuristic routing · See more »

Jon Bentley (computer scientist)

Jon Louis Bentley (born February 20, 1953 in Long Beach, California)Biography from.

New!!: Heuristic (computer science) and Jon Bentley (computer scientist) · See more »

Knapsack problem

The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.

New!!: Heuristic (computer science) and Knapsack problem · See more »

Machine learning

Machine learning is a subset of artificial intelligence in the field of computer science that often uses statistical techniques to give computers the ability to "learn" (i.e., progressively improve performance on a specific task) with data, without being explicitly programmed.

New!!: Heuristic (computer science) and Machine learning · See more »

Mathematical optimization

In mathematics, computer science and operations research, mathematical optimization or mathematical programming, alternatively spelled optimisation, is the selection of a best element (with regard to some criterion) from some set of available alternatives.

New!!: Heuristic (computer science) and Mathematical optimization · See more »

Matheuristics

Matheuristics are optimization algorithms made by the interoperation of metaheuristics and mathematical programming (MP) techniques.

New!!: Heuristic (computer science) and Matheuristics · See more »

Metaheuristic

In computer science and mathematical optimization, a metaheuristic is a higher-level procedure or heuristic designed to find, generate, or select a heuristic (partial search algorithm) that may provide a sufficiently good solution to an optimization problem, especially with incomplete or imperfect information or limited computation capacity.

New!!: Heuristic (computer science) and Metaheuristic · See more »

NP-completeness

In computational complexity theory, an NP-complete decision problem is one belonging to both the NP and the NP-hard complexity classes.

New!!: Heuristic (computer science) and NP-completeness · See more »

NP-hardness

NP-hardness (''n''on-deterministic ''p''olynomial-time hardness), in computational complexity theory, is the defining property of a class of problems that are, informally, "at least as hard as the hardest problems in NP".

New!!: Heuristic (computer science) and NP-hardness · See more »

Overfitting

In statistics, overfitting is "the production of an analysis that corresponds too closely or exactly to a particular set of data, and may therefore fail to fit additional data or predict future observations reliably".

New!!: Heuristic (computer science) and Overfitting · See more »

Plotter

The plotter is a computer printer for printing vector graphics.

New!!: Heuristic (computer science) and Plotter · See more »

Problem solving

Problem solving consists of using generic or ad hoc methods, in an orderly manner, to find solutions to problems.

New!!: Heuristic (computer science) and Problem solving · See more »

Rule of thumb

The English phrase rule of thumb refers to a principle with broad application that is not intended to be strictly accurate or reliable for every situation.

New!!: Heuristic (computer science) and Rule of thumb · See more »

Search algorithm

In computer science, a search algorithm is any algorithm which solves the search problem, namely, to retrieve information stored within some data structure, or calculated in the search space of a problem domain.

New!!: Heuristic (computer science) and Search algorithm · See more »

Search problem

In computational complexity theory and computability theory, a search problem is a type of computational problem represented by a binary relation.

New!!: Heuristic (computer science) and Search problem · See more »

Statistics

Statistics is a branch of mathematics dealing with the collection, analysis, interpretation, presentation, and organization of data.

New!!: Heuristic (computer science) and Statistics · See more »

Travelling salesman problem

The travelling salesman problem (TSP) asks the following 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?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.

New!!: Heuristic (computer science) and Travelling salesman problem · See more »

Turing Award

The ACM A.M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) to an individual selected for contributions "of lasting and major technical importance to the computer field".

New!!: Heuristic (computer science) and Turing Award · See more »

Usability

Usability is the ease of use and learnability of a human-made object such as a tool or device.

New!!: Heuristic (computer science) and Usability · See more »

Redirects here:

Heuristic (function), Heuristic algorithm, Heuristic function, Search heuristic.

References

[1] https://en.wikipedia.org/wiki/Heuristic_(computer_science)

OutgoingIncoming
Hey! We are on Facebook now! »