- exhaustive algorithm
- мат. исчерпывающий алгоритм
Большой англо-русский и русско-английский словарь. 2001.
exhaustive algorithm
Смотреть что такое "exhaustive algorithm" в других словарях:
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Grover's algorithm — is a quantum algorithm for searching an unsorted database with N entries in O(N1/2) time and using O( log N) storage space (see big O notation). It was invented by Lov Grover in 1996.Classically, searching an unsorted database requires a linear… … Wikipedia
Rete algorithm — The Rete algorithm is an efficient pattern matching algorithm for implementing production rule systems. The Rete algorithm was designed by Dr Charles L. Forgy of Carnegie Mellon University, first published in a working paper in 1974, and later… … Wikipedia
DPLL algorithm — The Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking based algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF SAT problem. It was introduced in … Wikipedia
Greedy algorithm — A greedy algorithm is any algorithm that follows the problem solving metaheuristic of making the locally optimum choice at each stage Paul E. Black, greedy algorithm in Dictionary of Algorithms and Data Structures [online] , U.S. National… … Wikipedia
Quine–McCluskey algorithm — The Quine–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of boolean functions which was developed by W.V. Quine and Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular… … Wikipedia
Watershed segmentation algorithm — A Watershed segmentation algorithm is an algorithm which utilizes watershed segmentation to segment images. [ [http://www.cs.utah.edu/ xwxue/Research/files/watershed.pdf LNCS 3804 Interactive 3D Heart Chamber Partitioning with a New Marker… … Wikipedia
British Museum algorithm — The British Museum algorithm is a general approach to find a solution by checking all possibilities one by one, beginning with the smallest. The term refers to a conceptual, not a practical, technique where the number of possibilities are… … Wikipedia
исчерпывающий алгоритм — Алгоритм, в котором используется максимальное число сочетаний (полный перебор) всех состояний объекта или управляющего процесса. [Л.М. Невдяев. Телекоммуникационные технологии. Англо русский толковый словарь справочник. Под редакцией Ю.М.… … Справочник технического переводчика
Maven (Scrabble) — Maven is the current best known artificial intelligence Scrabble player, created by Brian Sheppard. It has been used in official licensed Hasbro Scrabble games, and the downloadable Funkitron Scrabble. Contents 1 Algorithms 1.1 Game Phases 1.2… … Wikipedia
Metaheuristic — In computer science, metaheuristic designates a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. Metaheuristics make few or no assumptions about the… … Wikipedia
