- minimax procedure
- мат. минимаксная процедура
Большой англо-русский и русско-английский словарь. 2001.
minimax procedure
Смотреть что такое "minimax procedure" в других словарях:
Moving-knife procedure — In the mathematics of social science, and especially game theory, a moving knife procedure is a type of solution to the fair division problem. The canonical example is the division of a cake using a knife.[1] The simplest example is a moving… … Wikipedia
Claude Shannon — Claude Elwood Shannon (1916 2001) Born April … Wikipedia
Condorcet method — Part of the Politics series Electoral methods Single winner … Wikipedia
Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… … Wikipedia
JEUX (THÉORIE DES) — La théorie des jeux est, parmi les techniques de la recherche opérationnelle, celle qui s’occupe spécialement des situations dans lesquelles plusieurs personnes ont à prendre des décisions dont dépend un résultat qui les concerne. Les diverses… … Encyclopédie Universelle
operations research — the analysis, usually involving mathematical treatment, of a process, problem, or operation to determine its purpose and effectiveness and to gain maximum efficiency. [1940 45, Amer.] * * * Application of scientific methods to management and… … Universalium
Instant-runoff voting — Example instant runoff voting ballot … Wikipedia
Comparison of instant runoff voting to other voting systems — This article is a comparison of various voting systems with Instant runoff voting (IRV), also called the Alternative Vote , preferential voting and ranked choice voting. Contents 1 Categories 2 Voting system criteria 3 Voting system results … Wikipedia
Negamax — search is a slightly variant formulation of minimax search that relies on the zero sum property of a two player game. An animated pedagogical example showing the plain negamax algorithm (that is, without alpha beta pruning). The person performing … Wikipedia
Brute-force search — In computer science, brute force search or exhaustive search, also known as generate and test, is a trivial but very general problem solving technique that consists of systematically enumerating all possible candidates for the solution and… … Wikipedia
Decision theory — in economics, psychology, philosophy, mathematics, and statistics is concerned with identifying the values, uncertainties and other issues relevant in a given decision, its rationality, and the resulting optimal decision. It is closely related to … Wikipedia
