Results 191 to 200 of about 26,379 (227)
Some of the next articles are maybe not open access.
ZOR - Methods and Models of Operations Research, 1991
The author considers the minimax problem \[ \min_{x\in\Gamma}[\max_{y\in\Delta} f(x,y)],\tag{*} \] where \(\Gamma\subset\mathbb{R}^ m\), \(\Delta\subset\mathbb{R}^ n\), and \(f\) is a \(C^ 2\)-function. His aim is to compute a minimax point of (*) with and without constraints with the help of a differential equation with several parameters.
openaire +2 more sources
The author considers the minimax problem \[ \min_{x\in\Gamma}[\max_{y\in\Delta} f(x,y)],\tag{*} \] where \(\Gamma\subset\mathbb{R}^ m\), \(\Delta\subset\mathbb{R}^ n\), and \(f\) is a \(C^ 2\)-function. His aim is to compute a minimax point of (*) with and without constraints with the help of a differential equation with several parameters.
openaire +2 more sources
Moscow University Computational Mathematics and Cybernetics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A Bibliography on Minimax Trees
ICGA Journal, 1993This article lists all theoretical and practical papers, theses and reports known to the author on the subject of studying minimax trees and analyzing sequential and parallel minimax tree search algorithms.The items of the bibliography are listed in alphabetical order in accordance with the first author's name.
openaire +3 more sources
SIAM Journal on Control and Optimization, 1995
The relaxation of the optimal control problem with cost functional which is the supremum in time of some function $h(t,x,z)$ is determined. The trajectory is convexified in the usual way but the cost functional is convexified in a nonobvious manner. Thus, if the original value function is $V(t,x) = \inf _{\zeta \in \mathcal{Z}} \| {h(s,\xi (s),\zeta (s)
Barron, E. N., Jensen, R.
openaire +2 more sources
The relaxation of the optimal control problem with cost functional which is the supremum in time of some function $h(t,x,z)$ is determined. The trajectory is convexified in the usual way but the cost functional is convexified in a nonobvious manner. Thus, if the original value function is $V(t,x) = \inf _{\zeta \in \mathcal{Z}} \| {h(s,\xi (s),\zeta (s)
Barron, E. N., Jensen, R.
openaire +2 more sources
Experiments on alternatives to minimax
International Journal of Parallel Programming, 1986In the field of Artificial Intelligence, traditional approaches to choosing moves in games involve the use of the minimax algorithm. However, recent research results indicate that minimaxing may not always be the best approach. In this paper we report some measurements on several model games with several different evaluation functions.
Dana S. Nau +2 more
openaire +2 more sources
On the „bayesification“ of the minimax principle
Unternehmensforschung Operations Research - Recherche Opérationnelle, 1966The term “Bayesification” is introduced as meaning the adoption of criteria, that keep the Bayes type of solution as far as the knowledge of the probability distribution over the states of nature extends. A general decision model in Wald's sense is developed, Bayes and minimax solution are defined and reasons are given for the Bayesification.
openaire +2 more sources
SIAM Journal on Control and Optimization, 1987
A dual formulation for a convex minimax problem is presented and the notion of reducibility is introduced. For nonconvex problems, Rockafellar’s augmented Lagrangian is used to close the duality gap. We show how mathematical programming algorithms can be applied to the minimax problem and we develop a special algorithm for reducible minimax problems.
Hager, William W., Presler, Dwayne L.
openaire +1 more source
A dual formulation for a convex minimax problem is presented and the notion of reducibility is introduced. For nonconvex problems, Rockafellar’s augmented Lagrangian is used to close the duality gap. We show how mathematical programming algorithms can be applied to the minimax problem and we develop a special algorithm for reducible minimax problems.
Hager, William W., Presler, Dwayne L.
openaire +1 more source
Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems, 1986
In estimating minimax values, an important topic in the study of heuristic game tree searches, a pathological phenomenon sometimes results when the conventional minimax procedure is used as a back-up process. In this paper exact methods are derived for two different games, one using product-propagation rules as a back-up process and another not using ...
Chun-Hung Tzeng, Paul Walton Purdom Jr.
openaire +1 more source
In estimating minimax values, an important topic in the study of heuristic game tree searches, a pathological phenomenon sometimes results when the conventional minimax procedure is used as a back-up process. In this paper exact methods are derived for two different games, one using product-propagation rules as a back-up process and another not using ...
Chun-Hung Tzeng, Paul Walton Purdom Jr.
openaire +1 more source
Minimax ‐ Inspektionsstrategien
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1970openaire +1 more source