Skip to search formSkip to main contentSkip to account menu

Minimax

Known as: MM, Minmax algorithm, Maximin (philosophy) 
Minimax (sometimes MinMax or MM) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Most adaptive computing systems use reconfigurable hardware in the form of field programmable gate arrays (FPGAs). For these… 
Highly Cited
2004
Highly Cited
2004
Maximin strategy has its origin in game theory, but it can be adopted for effective multiobjective optimization. This paper… 
Highly Cited
2003
Highly Cited
2003
We address the problem of matched filter and subspace detection in the presence of arbitrary noise and interference or… 
Highly Cited
2002
Highly Cited
2002
The paper studies the problem of reachability for linear systems in the presence of uncertain (unknown but bounded) input… 
Highly Cited
1997
Highly Cited
1997
In the broad context of modelling for system design, it is normally assumed that all decision-makers cooperate fully and thus… 
Highly Cited
1991
Highly Cited
1991
This paper describes the recently developed "genetic programming" paradigm which genetically breeds populations of computer… 
Highly Cited
1987
Highly Cited
1987
Highly Cited
1980
Highly Cited
1980
John Rawls's A Theory of Justice' is an important book. It is an attempt to develop a viable alternative to utilitarianism, which… 
Highly Cited
1980
Highly Cited
1980
The problem considered is to locate a point in a given convex polyhedron which maximizes the minimum Euclidean distance from a…