- heuristic technique
-
эвристический метод
Англо-русский словарь технических терминов. 2005.
heuristic technique
Смотреть что такое "heuristic technique" в других словарях:
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
Null-move heuristic — In computer chess programs, the null move heuristic is a heuristic technique used to enhance the speed of the alpha beta pruning algorithm. Contents 1 Rationale 2 Implementation 3 Problems with the null move heuristic … Wikipedia
Shifting bottleneck heuristic — The Shifting Bottleneck Heuristic is a procedure intended to minimize the time it takes to do work, or specifically, the makespan in a job shop. The makespan is defined as the amount of time, from start to finish, to complete a set of multi… … Wikipedia
Killer heuristic — In competitive two player games, the killer heuristic is a technique for improving the efficiency of alpha beta pruning, which in turn improves the efficiency of the minimax algorithm. This algorithm has an exponential search time to find the… … Wikipedia
Multi-level technique — In mathematics, the multi level technique is a technique used to solve the graph partitioning problem. The idea of the multi level technique is to reduce the magnitude of a graph by merging vertices together, compute a partition on this reduced… … Wikipedia
DVO — • Dynamic Variable Ordering heuristic technique/heuristic for improving the efficiency of constraint satisfaction (KI) • Davao, Philippines internationale Flughafen Kennung … Acronyms
DVO — [1] Dynamic Variable Ordering heuristic technique/heuristic for improving the efficiency of constraint satisfaction ( KI) [2] Davao, Philippines internationale Fughafen Kennung … Acronyms von A bis Z
Backcountry snowboarding — is a unique sport that is rapidly growing in popularity. The sport of backcountry snowboarding is characterized by the fresh tracks and deep powder that only the slopes of a remote mountainside can offer. The sport is a completely separate… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
