본문 바로가기

자료구조 및 알고리즘

Metaheuristic and Heuristic


Metaheuristic

From Wikipedia, the free encyclopedia

Jump to: navigation, search

A metaheuristic is a heuristic method for solving a very general class of computational problems by combining user-given black-box procedures — usually heuristics themselves — in the hope of obtaining a more efficient or more robust procedure. The name combines the Greek prefix "meta" ("beyond", here in the sense of "higher level") and "heuristic" (from ευρισκειν, heuriskein, "to find").

Heuristic

From Wikipedia, the free encyclopedia

Jump to: navigation, search

Heuristic (pronounced /hjʊˈrɪstɨk/, from the Greek "Εὑρίσκω" for "find" or "discover") is an adjective for experience-based techniques that help in problem solving, learning and discovery. A heuristic method is particularly used to rapidly come to a solution that is hoped to be close to the best possible answer, or 'optimal solution'. Heuristics are "rules of thumb", educated guesses, intuitive judgments or simply common sense. A heuristic is a general way of solving a problem. Heuristics as a noun is another name for heuristic methods.

'자료구조 및 알고리즘' 카테고리의 다른 글

[RL] Tile coding  (0) 2012.01.13
(GA) Normalization in Genetic Algorithms  (0) 2010.06.29
Undecidable problem  (0) 2010.02.08
유전 알고리즘(CHC Eshelman)  (0) 2010.02.04
P,NP  (0) 2010.01.03