Concept information
PREFERRED TERM
heuristic
DEFINITION(S)
- a simple rule of thumb for making an acceptable choice in cases where there is no efficient algorithm for determining the optimal choice. For example, to calculate the shortest route through a given set of cities (the travelling salesman's problem), a route can be calculated by choosing an initial city at random, then applying the heuristic nearest neighbour rule (which consists of choosing the unvisited city closest to the last visited city) until all the cities have been visited. (Source: translated from https://ia.gdria.fr/Glossaire/graphes-conceptuels/ )
BROADER CONCEPT(S)
NARROWER CONCEPT(S)
IN OTHER LANGUAGES
-
French
URI
http://data.loterre.fr/ark:/67375/23L-B6BRS562-Q
{{toUpperCase label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}