英语释义

1. the minimum of a set of maxima especially the smallest of a set of maximum possible losses each of which occurs in the most unfavorable outcome of a strategy followed by a participant in a situation governed by game theory — compare maximin

片语

maximin(Maximin)人名；(法)马克西曼

minimax problemsMinimax问题

minimax criteria极小化最大準则

minimax property[数]

minimax search[计]

minimax strategy极小化极大策略

minimax risk大中取小风险

minimax solution[数]

MINIMAX控制minimax control

minimax principle最小最大原则

英汉例句

• in view of the conditions of the investors, the paper proposes the building of general assets allocation model and minimax model in terms of the general and pessimistic investors.

  考察投资者个人状况，分别针对一般理性投资者和悲观投资者，构建一般资产配置模型和极大极小模型。

• by using a known coincidence theorem, a minimax inequality is established in general topological space.

  利用已知的重合点定理，在一般拓扑空间内得到一个极大极小不等式定理。

• as their applications, some new systems of minimax theorems are given too.

  作为其应用，也给出了相应的极大极小组定理。

• so, much of the classical approach to ai consists of things like minimax trees, preprogrammed databases, and prewritten code.

  因此，许多古典方法认为人工智能应该由类似极大极小树，预编程数据库和预编代码组成。

• in the framework of modern financial theory, the concept and method of minimax design (or worst-case optimization) are proposed for the problem of portfolio choice.

  在现代金融理论的基本框架下，提出了证券选择的极大极小设计（即最差情况最优化）的概念与方法。

• methodsan entropy function method for the linear programs problem is proposed through the idea of entropy function, which is based on minimax problem with the arbitary point.

  方法通过利用熵函数的思想，给出了求解该类线性规划的调节熵函数法，由于算法是基于等价的极大极小问题，从而具有初始点任意性的优点。

• at last, we establish systems of coincidence theorem and system of minimax theorems in g-convex under weaker assumptions. our results generalize the corresponding results in recent literature.

  最后，在较弱的假设条件下，讨论了g-凸空间中的重合点组定理与极大极小组定理，从而推广了近期文献的相关结论。

• the minimax game tree is used for programming computers to play games in which there are two players taking turns to play moves.

  极大极小博弈树(minimaxgametree,简写为mgt，译者注)用于编写电脑之间的游戏程序，这类程序由两个游戏者轮流，每次执行一个步骤。

• so, one of the first researchers on the minimax tree decided to name player x as max and player o as min. thus, the entire data structure came to be called the minimax game tree .

  于是，第一位研究此问题的研究者决定把游戏者叉命名为马克思，并且把游戏者圈命名为米恩。因此，这个完整的数据结构就被命名为极大（max,马克思,译者注）极小（min,米恩，译者注）博弈树。

• this paper has given a new nonsymmetric neural network model, which can be used to solve unconstrained minimax problem.

  本文构造了一种新的非对称神经网络模型，用于求解极大极小无约束优化问题。

• the minimax game tree, of course, cannot be used very well for games in which the computer cannot see the possible moves.

  mgt当然不能预测所有计算机游戏的可能步骤。

• minimax theorem in a general topological space is obtained. moreover, a saddle point theorem on a topological space without any linear structure is established.

  在此基础上，在一般的拓扑空间上建立了极大极小定理，并把着名的鞍点定理推广到没有线性结构的拓扑空间上·。

• a minimax theorem generally involves three assumption conditions: space structures on sets x and y, the continuity of the functions and the concavity and convexity of functions.

  一个极大极小定理一般涉及三个假设条件：集合x和y的空间结构，函数的连续性和函数的凹凸性。

• some parametric type kkm theorems are proved in interval spaces, and soine new vector valued minimax theorems are obtained.

  证明了区间空间上几个参数型kkm定理并得到了几个新型的向量值极大极小定理。

• in this note, error bounds of maximum entropy method for finite minimax problems with convexity as well as uniformly convexity are investigated.

  对具有凸性和一致凸性的极大极小问题，研究了极大熵方法得到的最优解和最优值的误差界。

• in chapter two, we prove a nonempty intersection theorem in l-convex space by using a continuous selection theorem. as applications, some minimax inequalities are obtained.

  在第二章中，我们运用一个连续选择定理证明了l-凸空间中的一个非空交定理．作为应用，我们得到了一些极大极小不等式．。

• in the thesis , we use the single-index method and the minimax method to analyse the optimum investment combination of the open fund.

  本文基于开放式基金的特征，用单指数模型和极大极小模型分析了单阶段开放式基金的投资组合最优化选择问题。

• thereinto the concavity and convexity of functions is important condition in minimax theory.

  其中函数的凹凸性是极大极小定理的重要条件。

• chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems.

  第3章给出无约束极大极小问题的一个对偶算法的收敛理论。

• minimax problem is a sort of non-differentiable optimization problem and the entropy function method provides a efficient approach to solve such kind of problems.

  极大极小问题是一类不可微优化问题，熵函数法是求解这类问题的一种有效算法。

• minimax is a linux distribution that fits entirely in an initrd image!

  minimax是一个完全封装在initrd映像文件中的linux发行版！

• the minimax tree is at the heart of almost every board game program in existence.

  对于几乎每一个棋类博弈游戏程序来说，极大极小树（theminimaxtree）都是其中的核心。

• as applications, we utilize the results to study the minimax problem and the equilibrium problem for generalized economy.

  作为应用，我们研究了极大极小问题和广义经济平衡问题。

• notice that unlike other trees like binary trees, 2-3 tres, and heap trees, a node in the minimax game tree can have any number of children, depending on the game situation.

  我们注意到这棵树不同于其他的树结构，比如二叉树，23树以及堆树(heaptree,译者注)，根据游戏规则，一个mgt节点上可能有很多个子节点。

• this minimax logic can also be extended to games like chess .

  极大极小逻辑也被用于其它博弈，比如国际象棋中。

• in these more complicated games, however, the programs can only look at the part of the minimax tree; often, the programs can't even see the end of the game because it is so far down the tree.

  然而，在这些更复杂的博弈中，程序仅仅能搜索极大极小树中的一部分；由于树太过庞大，程序往往不能搜索到博弈最终的结局。

• so, minimax game trees is best used for games in which both players can see the entire game situation.

  因此，仅仅对于两个游戏者都能看到全部博弈形式的游戏来说，mgt才是最好的选择。

• a new minimax theorem and some theorems for variational inequalities with generalized monotone multivalued mapping in h-spaces are obtained.

  得到h-空间中的一个新的极大极小定理和几个广义单调集值映象的变分不等式定理。

• by virtue of this minimax problem as well as the directionally differentiable property of the functions in every subproblem, the first-order optimality conditions are obtained.

  利用这个极大极小问题及子问题中各函数的方向可微性给出了子问题的一阶最优性条件。