Digite uma palavra ou frase em qualquer idioma 👆
Idioma:
Tradução e análise de palavras por inteligência artificial ChatGPT
Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:
- como a palavra é usada
- frequência de uso
- é usado com mais frequência na fala oral ou escrita
- opções de tradução de palavras
- exemplos de uso (várias frases com tradução)
- etimologia
O que (quem) é minimax method - definição
ELECTORAL SYSTEM
Simpson-Kramer method; Minimax condorcet; Simpson–Kramer method; Minimax Condorcet
Minimax Condorcet method
In voting systems, the Minimax Condorcet method (often referred to as "the Minimax method") is one of several Condorcet methods used for tabulating votes and determining a winner when using ranked voting in a single-winner election. It is sometimes referred to as the Simpson–Kramer method, and the successive reversal method.
Minimax theorem
THEOREM PROVIDING CONDITIONS THAT GUARANTEE THAT THE MAX–MIN INEQUALITY IS ALSO AN EQUALITY
Von Neumman's minimax theorem
In the mathematical area of game theory, a minimax theorem is a theorem providing conditions that guarantee that the max–min inequality is also an equality.
Method (computer programming)
COMPUTER FUNCTION OR SUBROUTINE THAT IS TIED TO A PARTICULAR INSTANCE OR CLASS
Class method; Instance method; Abstract method; Static method; Method (object-oriented programming); Method (programming); Member function; Method heading; Method name; Method (computing); Method (oo); Static functions; Static function; Static methods; Final method; Method (computer science); Hooking method; Method call; Special method; Overloaded method; Operator method; Method calls
A method in object-oriented programming (OOP) is a procedure associated with a message and an object. An object consists of state data and behavior; these compose an interface, which specifies how the object may be utilized by any of its various consumers.
Wikipédia
Minimax Condorcet method
In voting systems, the Minimax Condorcet method (often referred to as "the Minimax method") is one of several Condorcet methods used for tabulating votes and determining a winner when using ranked voting in a single-winner election. It is sometimes referred to as the Simpson–Kramer method, and the successive reversal method.
Minimax selects as the winner the candidate whose greatest pairwise defeat is smaller than the greatest pairwise defeat of any other candidate: or, put another way, "the only candidate whose support never drops below [N] percent" in any pairwise contest.
