- heuristic search
-
эвристический поиск
Англо-русский словарь технических терминов. 2005.
heuristic search
Смотреть что такое "heuristic search" в других словарях:
heuristic search — heuristinė paieška statusas T sritis automatika atitikmenys: angl. heuristic search vok. heuristische Suche, f rus. эвристический поиск, m pranc. recherche heuristique, f … Automatikos terminų žodynas
Search-based software engineering — (SBSE) is an approach to apply metaheuristic search techniques like genetic algorithms, simulated annealing and tabu search to software engineering problems. It is inspired by the observation that many activities in software engineering can be… … Wikipedia
Heuristic — (hyu̇ ˈris tik) is a method to help solve a problem, commonly an informal method. It is particularly used to rapidly come to a solution that is reasonably close to the best possible answer, or optimal solution . Heuristics are rules of thumb ,… … Wikipedia
Heuristic — Heu*ris tic (h[ u]*r[i^]s t[i^]k), a. [Gr. e yri skein to discover.] 1. Serving to promote discovery or learning; used especially of thories or paradigms which stimulate new ideas for discovering facts in experimental sciences. [1913 Webster… … The Collaborative International Dictionary of English
Heuristic function — A heuristic function or simply a heuristic is a function that ranks alternatives in various search algorithms at each branching step basing on an available information in order to make a decision which branch is to be followed during a… … Wikipedia
Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… … Wikipedia
Heuristic algorithm — In computer science, a heuristic algorithm or simply a heuristic is an algorithm that ignores whether the solution to the problem can be proven to be correct, but which usually produces a good solution or solves a simpler problem that contains or … Wikipedia
A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… … Wikipedia
Hyper-heuristic — A hyper heuristic is a heuristic search method that seeks to automate, often by the incorporation of machine learning techniques, the process of selecting, combining, generating or adapting several simpler heuristics (or components of such… … Wikipedia
Bidirectional search — is a graph search algorithm that runs two simultaneous searches: one forward from the initial state, and one backward from the goal, and stopping when the two meet in the middle. The reason for this approach is that each of the two searches has… … Wikipedia
Guided Local Search — is a metaheuristic search method. A meta heuristic method is a method that sits on top of a local search algorithm to change its behaviour. Guided Local Search builds up penalties during a search. It uses penalties to help local search algorithms … Wikipedia
