About: Heuristic (computer science)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Heuristic (computer science) Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:TopicalConcept, within Data Space : el.dbpedia.org associated with source document(s)

In mathematical optimization and computer science, 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. This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut.

Attributes	Values
rdf:type	topical concept
rdfs:label	Heuristic (computer science) (en)
rdfs:comment	In mathematical optimization and computer science, 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. This is achieved by trading optimality, completeness, accuracy, or precision for speed. In a way, it can be considered a shortcut. (en)
sameAs	Heuristic (computer science) Heuristic (computer science) Heuristic (computer science)
dbp:wikiPageUsesTemplate	dbt:Other_uses dbt:Reflist dbt:Short_description dbt:Wiktionary
Subject	Heuristic algorithms
Link from a Wikipa... related subject.	dbpedia-de:Heuristik
gold:hypernym	Technique
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Heuristic_(computer_science)?oldid=1071826355&ns=0
Wikipage page ID	14220429 (xsd:integer)
page length (characters) of wiki page	11010 (xsd:nonNegativeInteger)
Wikipage revision ID	1071826355 (xsd:integer)
Link from a Wikipage to another Wikipage	Greedy algorithm Greek language Machine learning Macro (computer science) NP-hardness Problem solving A* search algorithm Accuracy and precision Admissible heuristic Algorithm Allen Newell Alpha–beta pruning Antivirus software Best-first search Statistical inference Turing Award Genetic algorithm Jon Bentley Heuristic algorithms Metaheuristic Search algorithm Search problem Plotter Rule of thumb Computer science Confidence interval Constructive heuristic Herbert A. Simon Heuristic Heuristic evaluation Heuristic routing Overfitting Function (mathematics) Travelling salesman problem Usability Knapsack problem Mathematical optimization Matheuristics Polymorphic code Recursion (computer science)
has abstract	In mathematical optimization and computer science, 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. 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Heuristic_(computer_science)
is rdfs:seeAlso of	Heuristic
is Wikipage redirect of	Search heuristic Heuristic search Heuristics in computer science Heuristic (function) Heuristic algorithm Heuristic function
is Link from a Wikipage to another Wikipage of	Flow-shop scheduling Greedy algorithm Machine learning NP-completeness Nucleic acid structure prediction Null-move heuristic Numbers (season 4) 15 puzzle 360 Safeguard A* search algorithm Abstraction (computer science) Admissible heuristic Algorithm Algorithmic Antivirus software Approximate Bayesian computation Approximation algorithm Arimaa Artificial intelligence in video games Automated planning and scheduling Automatically Tuned Linear Algebra Software BLAST (biotechnology) BLAT (bioinformatics) Bak–Sneppen model Beam search Best-first search Bidirectional search Black box Block suballocation Monotonic function Monte Carlo tree search Bounce message Brain storm optimization algorithm Brute-force search

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software