- optimal ordering
- мат. оптимальное упорядочение
Большой англо-русский и русско-английский словарь. 2001.
optimal ordering
Смотреть что такое "optimal ordering" в других словарях:
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Merge sort — Example of merge sort sorting a list of random dots. Class Sorting algorithm Data structure Array Worst case performance O(n log n) … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Coffman–Graham algorithm — In job shop scheduling and graph drawing, the Coffman–Graham algorithm is an algorithm, named after Edward G. Coffman, Jr. and Ronald Graham, for arranging the elements of a partially ordered set into a sequence of levels. The algorithm chooses… … Wikipedia
Web crawler — For the search engine of the same name, see WebCrawler. For the fictional robots called Skutters, see Red Dwarf characters#The Skutters. Not to be confused with offline reader. A Web crawler is a computer program that browses the World Wide Web… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Alpha-beta pruning — is a search algorithm which seeks to reduce the number of nodes that are evaluated in the search tree by the minimax algorithm. It is a search with adversary algorithm used commonly for machine playing of two player games (Tic tac toe, Chess, Go … 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
High-temperature superconductivity — Unsolved problems in physics What causes superconductivity at temperatures above 50 kelvin? High temperature superconductors (abbreviated high Tc or HTS) are materials that have a superconducting transition temperature (Tc) above 30 K… … Wikipedia
Economic order quantity — is that level of inventory that minimizes the total of inventory holding cost and ordering cost. The framework used to determine this order quantity is also known as Wilson EOQ Model. The model was developed by F. W. Harris in 1913. But still R.… … Wikipedia
Ernst Zermelo — Ernst Friedrich Ferdinand Zermelo (July 27 1871, Berlin, German Empire – May 21 1953, Freiburg im Breisgau, West Germany) was a German mathematician, whose work has major implications for the foundations of mathematics and hence on… … Wikipedia
