The two-watchman route problem is that of computing a pair of closed tours in an environment so that the two tours together see the whole environment and some length measure on the two tours is minimized. Two standard measures are: the minmax measure, where we want the tours where the longest of them has minimal length, and the minsum measure, where we want the tours for which the sum of their ...

We show that for any discount factor, there is a natural number M such that all subgame perfect outcomes of the discounted repeated prisoners’ dilemma (pure strategies) can be obtained by subgame perfect strategies with the following property: current play depends only on the number of the time-index and on the history of the last M periods. This strong result, however, does not suffice to esta...

The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm are shown to be inappropriate error measures for color image quantization. A fast and effective (improves image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique cal...

Virtual Backbones (VBs) are expected to bring substantial benefits to routing in Wireless Sensor Networks (WSNs). Connected Dominating Sets (CDSs) based VBs are competitive approaches among the existing methods used to establish VBs in WSNs. Most existing works focus on constructing Minimum-sized CDSs (MCDSs). However, few works consider the load-balance factor. In this work, the size and the l...

The paper scrutinizes various stylized facts related to the minmax theorem for chess. We first point out that, in contrast to the prevalent understanding, chess is actually an infinite game, so that backward induction does not apply in the strict sense. Second, we recall the original argument for the minmax theorem of chess which is forward rather than backward looking. Then it is shown that, a...

Warp and weft spacing and its coefficient of variation affect the physical properties of fabrics such as fabric hand, frictional and mechanical properties. In this paper the weft and warp spacing and its coefficient of variation for plain weave is calculated using Fourier transforms. Different methods have been used in this work including autocorrelation function. First, two dimensional power s...

Warp and weft spacing and its coefficient of variation affect the physical properties of fabrics such as fabric hand, frictional and mechanical properties. In this paper the weft and warp spacing and its coefficient of variation for plain weave is calculated using Fourier transforms. Different methods have been used in this work including autocorrelation function. First, two dimensional power s...

[4] Igor Averbakh. Minmax regret solutions for minmax optimization problems with uncertainty. [5] Igor Averbakh. On the complexity of a class of combinatorial optimization problems with uncertainty. [7] Igor Averbakh and Oded Berman. Minimax regret p-center location on a network with demand uncertainty. [8] Igor Averbakh and Oded Berman. Minmax p-traveling salesman location problems on a tree.

In this letter, we study the R-D properties of independent sources based on MSE and SSIM, and compare the bit allocation performance under the MINAVE and MINMAX criteria in video encoding. The results show that MINMAX has similar results in terms of average distortion with MINAVE by using SSIM, which illustrates the consistency between these two criteria in independent perceptual video coding. ...