本文根据极大极小代数理论，给出了一种用以求解动态规划中有限多阶段决策问题的代数算法。
On the basis of minimax algebra theory, this paper provides an algebra method of solving countable stages decision problems in the dynamic programming.
基于潘家铮极大极小值原理，结合和声搜索算法提出了一种土坡稳定分析的新方法。
A new method of stability analysis of slopes is presented based on Panjiazheng extremum principle and harmony search method.
讨论一类带约束的极大极小问题并给出一个广义投影型的算法，利用问题的特性而使算法有较简单的结构。
In this paper, a type of Min Max problem with constraints has been discussed and a generalized projection method has been given for solving this problem.
第3章给出无约束极大极小问题的一个对偶算法的收敛理论。
Chapter 3 is devoted to the study of the convergence theory of a dual algorithm for unconstrained minimax problems.
本文以极大极小代数为基础，给出了一种求解水资源最优规划问题的代数算法。最后用实例验证了该法的有效性。
On the base of the minimax-algebra, this paper proposes an algebra method to solve the optimum planning question of the water resources, and this paper proves its effectiveness by a real example.
极大极小问题是一类不可微优化问题，熵函数法是求解这类问题的一种有效算法。
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.
将算法应用于极小极大选址问题的实验结果表明，算法能够有效地求解极小极大选址问题，具有较好的应用价值。
The test experiments for solving min-max location problem show that the proposed solution can effectively reduce the cost of location problem, and has good application value.
尤其在游戏将结束时，战术比策略显得更为重要，AI就容易输棋(蒙特卡罗算法和极小极大算法都有这种问题)。
Especially, the AI starts losing out near the end game when tactics mean a lot more than overall strategy (which Monte Carlo and Minimax seem to do well at).
尤其在游戏将结束时，战术比策略显得更为重要，AI就容易输棋(蒙特卡罗算法和极小极大算法都有这种问题)。
Especially, the AI starts losing out near the end game when tactics mean a lot more than overall strategy (which Monte Carlo and Minimax seem to do well at).
应用推荐