Heuristic (computer science)
Type of algorithm that may sometimes fail or produce an approximate, incorrect, or suboptimal result
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. This is achieved by trading optimality, completeness, accuracy, or precision for speed.
Nº Q1981968 ★★
Uncommon · History
Heuristic (computer science)
Type of algorithm that may sometimes fail or produce an approximate, incorrect, or suboptimal result
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. This is achieved by trading optimality, completeness, accuracy, or precision for speed.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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. This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut. A heuristic function, also simply called a heuristic, is a function that ranks alternatives in search algorithms at each branching step based on available information to decide which branch to follow. For example, it may approximate the exact solution.
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
Heuristic
Problem-solving method that is sufficient for quick, short-term solutions/approximations
Nº Q201413 ★★★★
Availability heuristic
Tendency and mental shortcut of preferring an item with more available information
Nº Q1462985 ★★
Computational science
Field concerned with constructing mathematical models and quantitative analysis techniques and using computers to analyze and solve scientific problems
Nº Q117801 ★★
Complexity
Behavior of a system or model with many parts interacting in multiple ways
Nº Q723897 ★★
Deconvolution
Algorithm-based process used to reverse the effects of convolution on recorded data
Nº Q1183700 ★
Computational complexity theory
Theoretical computer science and mathematics theory that classifies problems according to their inherent difficulty, and relates those classes to each other
Nº Q205084 ★★