Publication Date
2-1-2022
Abstract
In many practical situations, we need to process data under fuzzy uncertainty: we have fuzzy information about the algorithm's input, and we want to find the resulting information about the algorithm's output. It is known that this problem can be reduced to computing the range of the algorithm over alpha-cuts of the input. Since the fuzzy degrees are usually known with accuracy at best 0.1, it is sufficient to repeat this range-computing procedure for 11 values alpha = 0, 0.1, ..., 1.0. However, a straightforward application of this idea requires 11 times longer computation time than each range estimation -- and for complex algorithms, each range computation is already time-consuming. In this paper, we show that when all inputs are of the same time, we can compute all the desired ranges much faster.
Comments
Technical Report: UTEP-CS-22-25