Examples of using Minimax in English and their translations into Russian
{-}
-
Official
-
Colloquial
Alpha-beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.
In support of its claim, Minimax submitted the subcontract and a copy of the Purchase Order,
Minimax also submitted an unsworn statement from its engineer on the Project dated 21 June 2001.
A data structure constructed from the minimum spanning tree allows the minimax distance between any pair of vertices to be queried in constant time per query, using lowest common ancestor queries in a Cartesian tree.
dated 3 August 1990, Minimax advised Alphamain Ltd., Laindon, England,("Alphamain")(Techno's shipping agent)
Minimax stated that it valued the lost items of property according to purchase prices,
The leaves of the Cartesian tree represent the vertices of the input graph, and the minimax distance between two vertices equals the weight of the Cartesian tree node that is their lowest common ancestor.
dated 24 August 1990, Techno notified Minimax that it was refusing shipment of the goods in the Purchase Order
Minimax also provided a list of expenses related to re-establishing its operations after the liberation of Kuwait,
In computational complexity theory, Yao's principle or Yao's minimax principle states that the expected cost of a randomized algorithm on the worst case input, is no better than the expected cost, for a worst-case
The Panel finds that because Minimax did not actually ship its goods to Kuwait, it did not actually suffer a loss. Minimax failed to provide evidence that the goods were specially manufactured for the Project
a widest path may be found as the path between the two vertices in the maximum spanning tree of the graph, and a minimax path may be found as the path between the two vertices in the minimum spanning tree.
naturally have two phases, such as minimax(min and max),
q in the infinite Euclidean point set defined by the Gaussian primes, the minimax path in the Gaussian primes between p
Minimax(sometimes MinMax or MM)
It is possible to find maximum-capacity paths and minimax paths with a single source
By using a minimax path, where the weight of an edge is the maximum travel time from a point on the edge to the farthest possible service call,
If all edge weights of an undirected graph are positive, then the minimax distances between pairs of points(the maximum edge weights of minimax paths)
As in the undirected graph problem, this Euclidean minimax path problem can be solved efficiently by finding a Euclidean minimum spanning tree: every path in the tree is a minimax path.
The minimax facility location problem seeks a location which minimizes the maximum distance to the sites,