where for any $F \subseteq V,d(j,F) = \min _{feF} d(j,f)$ . This is a "min-max" or "robust" version of the k-median problem. Note that in contrast to the recent ...
in games like chess, Go, poker, Connect-4, etc., adversarial search techniques have traditionally been used to create intelligent computer players for these games assuming a 2-player game like chess, ...
The Journal of the Operational Research Society, Vol. 53, No. 10, Special Issue: Applications and Developments in Mathematical Programming (Oct., 2002), pp. 1109-1117 (9 pages) In the min-max loop ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback