The minimax choice is minimizing the maximum "regret".
大中取小选择是最小化最大的遗憾。
Minimax is a Linux distribution that fits entirely in an initrd image!
Minimax是一个完全封装在initrd映像文件中的Linux发行版！
The implications of the Minimax theorem are tested using field data.
本文利用田野数据对最小最大定理进行验证。
As their applications, some new systems of minimax theorems are given too.
作为其应用，也给出了相应的极大极小组定理。
Although in many papers it is not formally emphasized, the minimax approach was used.
虽然在很多文章中，它不是着重强调极小极大方法的使用。
The optimal design of minimax deflection of an annular plate is studied in this paper.
本文讨论环形板的最大挠度极小化的优化设计。
Two new existence theorems are obtained by the minimax methods in critical point theory.
通过使用临界点理论中的极大极小方法获得了两个新的存在性定理。
This paper proposes a new minimax geometric distance priority method used for group-AHP (MGDM).
对群组判断矩阵提出一种新的最小最大几何距离排序方法（MGDM）。
Minimax principle deals with the relation between the minimax value and maximin value of a function.
极小极大原理论述的是函数的极小极大值与极大极小值之间的关系。
By using a known coincidence theorem, a minimax inequality is established in general topological space.
利用已知的重合点定理，在一般拓扑空间内得到一个极大极小不等式定理。
With a full minimax tree, the computer could look ahead for each move to determine the best possible move.
对一棵完整的极大极小树来说，计算机能够向前遍历每一步，直到找到最佳步骤为止。
In the problems of minimax tree search, what we are looking for is often the optimal branch at the root node.
在极大极小树搜索时，我们经常寻找的是根节点的最优分支。
Chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems.
第3章给出无约束极大极小问题的一个对偶算法的收敛理论。
So, much of the classical approach to AI consists of things like minimax trees, preprogrammed databases, and prewritten code.
因此，许多古典方法认为人工智能应该由类似极大极小树，预编程数据库和预编代码组成。
The minimax game tree, of course, cannot be used very well for games in which the computer cannot see the possible moves.
MGT当然不能预测所有计算机游戏的可能步骤。
As applications, we utilize the results to study the minimax problem and the equilibrium problem for generalized economy.
作为应用，我们研究了极大极小问题和广义经济平衡问题。
Robust regression analysis and minimax residual error analysis are two aspects in data processing of dynamic measurement.
在动态测试数据处理中，常常要进行稳健回归分析和最小最大值回归分析。
Some parametric type KKM theorems are proved in interval spaces, and soine new vector valued minimax theorems are obtained.
证明了区间空间上几个参数型KKM定理并得到了几个新型的向量值极大极小定理。
A method for solving minimax problem is presented, which also can be used to solve linear or constrained optimization problems.
提出了一类解极小极大问题的熵函数法，这种方法也可用来解线性或约束优化问题。
The Minimax game Tree is used for programming computers to play games in which there are two players taking turns to play moves.
极大极小博弈树(Minimax Game Tree，简写为MGT，译者注)用于编写电脑之间的游戏程序，这类程序由两个游戏者轮流，每次执行一个步骤。
In the present paper some theorems for variational inequalities and minimax inequality are obtained in hyperconvex metric spaces.
摘要文章给出了超凸度量空间中的一些变分不等式定理和极大极小不等式定理。
Using game theory, the minimax robust state estimator is designed, which can minimize the worst performance un-der the uncertain noise.
针对噪声不确定性，文章采用对策论的基本原理，导出了一种最小化不确定下最坏性能的极小极大鲁棒状态估计器。
On theoretical aspect, we knew that the minimax problem and the multilevel programming problems can be reformulated into MPEC problems.
在理论方面我们获知，极小极大问题和多层优化问题都可转化为MPEC问题来求解。
As applications, a fixed point theorem, a maximal element theorem, a coincidence theorem, some minimax inequalities are proved in FC-space.
作为应用，一不动点定理，一极大元定理，一重合点定理和一些极小极大不等式被证明。
These three papers study and develop, for different fields and practical problems, the gibbs models based on the minimax entropy principle.
这三篇文献从不同的应用场合和建模方法介绍了基于最小最大熵准则的吉布斯模型是如何成功设计和应用的。
A new minimax theorem and some theorems for variational inequalities with generalized monotone multivalued mapping in H-spaces are obtained.
得到H -空间中的一个新的极大极小定理和几个广义单调集值映象的变分不等式定理。
In Section 8, we shall discuss two-function minimax inequalities and their applications to variational inequalities and to fixed-point theory.
在第8章，我们将讨论两个函数极小极大不等式及其对变分不等式和不动点理论的应用。
Two kinds of resource management algorithms, the minimum mean deviation criterion and the minimax deviation criterion, are proposed, respectively.
分别提出了基于协方差偏差均值最小准则和最大协方差偏差最小准则两类资源管理算法。
On the basis of minimax algebra theory, this paper provides an algebra method of solving countable stages decision problems in the dynamic programming.
本文根据极大极小代数理论，给出了一种用以求解动态规划中有限多阶段决策问题的代数算法。
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
也许同样重要的是基本的算法，如二进制搜索，图形搜索算法，排序算法，并基于树的极小搜索。
应用推荐