This paper describes comparisons of the minimax back-up rule and the product back-up rule on a wide variety of games, including Pgames, G-games, three-hole kalah, othello, and Ballard's incremental game. In three-hole kalah, the product rule plays better than a minimax search to the same depth. This is a remarkable result, since it is the first widely known game in which product has been found ...

Let Xn = (X1; ; Xn) be a memoryless source with unknown distribution on a finite alphabet of size k. We identify the asymptotic minimax coding redundancy for this class of sources, and provide a sequence of asymptotically minimax codes. Equivalently, we determine the limiting behavior of the minimax relative entropy minQ maxP D(PX kQX ), where the maximum is over all independent and identically...

We attempt to recover an unknown function from noisy, sampled data. Using orthonormal bases of compactly supported wavelets we develop a nonlinear method which works in the wavelet domain by simple nonlinear shrinkage of the empirical wavelet coe cients. The shrinkage can be tuned to be nearly minimax over any member of a wide range of Triebeland Besov-type smoothness constraints, and asymptoti...

This paper proposes a frame rate-control scheme with a MINMAX distortion criterion in the framework of a rate-distortion optimized motion compensated embedded wavelet coder. The MINMAX criterion aims to minimize the maximum distortion in a group of pictures (GOP) for a given bit rate. The proposed frame level bit allocation scheme combined with R-D optimized within frame allocation allows preci...

The objective of the research is to study distal circulation and assess results post-COVID rehabilitation treatment. A total 107 reconvalescents were examined, with a control group 56 patients. effectiveness therapy was estimated help microcirculation parameters registered by Minimax-Doppler-K system before after authors found correlation between measurements data examinations, as well other pr...

IMP-minimax is the analog to minimax for games with imperfect information, like card games such as bridge or poker. It computes an optimal strategy for the game if the game has a single player and a certain natural property called perfect recall. IMP-minimax is described fully in a companion paper in this proceedings. Here we introduce an algorithm IMP-alpha-beta that is to IMP-minimax s alpha-...

In this paper, a new objective penalty function approach is proposed for solving minimax programming problems with equality and inequality constraints. This new objective penalty function combines the objective penalty and constraint penalty. By the new objective penalty function, a constrained minimax problem is converted to minimizations of a sequence of continuously differentiable functions ...

Minimax Rules Under Zero-One Loss In this paper, we obtain minimax and near-minimax nonrandomized decision rules under zeroone loss for a restricted location parameter of an absolutely continuous distribution. Two types of rules are addressed: monotone and nonmonotone. A complete-class theorem is proved for the monotone case. This theorem extends the previous work of Zeytinoglu and Mintz (1984)...

In this paper we study and develop several robust decoding algorithms based on the minimax rule. Keywords—The Viterbi algorithm, MAP decoder, minimax robust signal processing, likelihood separation metric, impulsive noise.