A Parallel Algorithm to Compute the Supremum of Max-Min Powers
AbstractWe 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.
Download data is not yet available.
How to Cite
Suraweera, F., & Bhattacharya, P. (2012). A Parallel Algorithm to Compute the Supremum of Max-Min Powers. COMPUTING AND INFORMATICS, 15(6), 579–587. Retrieved from https://www.cai.sk/ojs/index.php/cai/article/view/681