TY - JOUR
AU - Suraweera, F.
AU - Bhattacharya, P.
PY - 2012/03/05
Y2 - 2024/03/05
TI - A Parallel Algorithm to Compute the Supremum of Max-Min Powers
JF - COMPUTING AND INFORMATICS
JA - Comput. Inform.
VL - 15
IS - 6
SE - Articles
DO -
UR - https://www.cai.sk/ojs/index.php/cai/article/view/681
SP - 579-587
AB - We present a parallel algorithm to compute the supremum of max-min powers of any map from the Cartesian product of a finite set to a bounded subset of the real numbers which can be run on an SIMD machine. The algorithm is based on graph theoretical methods. Some variations of the parallel algorithm are also considered.
ER -