Diclib.com
Diccionario ChatGPT

Búsqueda en el diccionario Soluciones personalizadas

Ingrese una palabra o frase en cualquier idioma 👆

Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

cómo se usa la palabra
frecuencia de uso
se utiliza con más frecuencia en el habla oral o escrita
opciones de traducción
ejemplos de uso (varias frases con traducción)
etimología

Qué (quién) es minimax algorithm - definición

DECISION RULE USED IN ARTIFICIAL INTELLIGENCE, DECISION THEORY, GAME THEORY, STATISTICS AND PHILOSOPHY FOR MINIMIZING THE POSSIBLE LOSS FOR A WORST CASE (MAXIMUM LOSS) SCENARIO

Minimax algorithm; Minimax test; Maximin principle; Maximin criterion; Minmax; Maximin (decision theory); Bottleneck programming; Minimax strategy; Game value; Maximin (philosophy); Minimax principle; Maxmin; MiniMax; Minimax Strategy; Minimax solution; Minmax algorithm; Maximin Principle

Minimax approximation algorithm

METHOD TO FIND AN APPROXIMATION OF A MATHEMATICAL FUNCTION THAT MINIMIZES MAXIMUM ERROR

L∞ approximation; Minimax polynomial; Uniform approximation algorithm

A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that minimizes maximum error.

https://en.wikipedia.org/wiki/Minimax_approximation_algorithm

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.

https://en.wikipedia.org/wiki/Minimax_theorem

Prim's algorithm

ALGORITHM

Jarnik algorithm; Prim-Jarnik algorithm; Prim-Jarnik's algorithm; Jarnik's algorithm; Prim-Jarník; DJP algorithm; Jarník algorithm; Jarník's algorithm; Jarníks algorithm; Jarniks algorithm; Prim-Jarník algorithm; Prim-Jarnik; Prim algorithm; Prim’s algorithm; Jarník-Prim; Prims algorithm

In computer science, Prim's algorithm (also known as Jarník's algorithm) is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.

https://en.wikipedia.org/wiki/Prim's_algorithm

Wikipedia

Minimax

Minimax (sometimes MinMax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, game theory, statistics, and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario. When dealing with gains, it is referred to as "maximin" – to maximize the minimum gain. Originally formulated for several-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of uncertainty.

https://en.wikipedia.org/wiki/Minimax