A Parallel Algorithm to Compute the Supremum of Max-Min Powers
F. Suraweera ; P. Bhattacharya
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
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.
Publié le : 2012-01-26
Classification:  
@article{cai681,
     author = {F. Suraweera and P. Bhattacharya},
     title = {A Parallel Algorithm to Compute the Supremum of Max-Min Powers},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai681}
}

F. Suraweera; P. Bhattacharya. A Parallel Algorithm to Compute the Supremum of Max-Min Powers. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai681/