While, In General, Uncertainty Quantification (UQ) Is NP-Hard, Many Practical UQ Problems Can Be Made Feasible

Ander Gray, Scott Ferson, Olga Kosheleva, Vladik Kreinovich. While, In General, Uncertainty Quantification (UQ) Is NP-Hard, Many Practical UQ Problems Can Be Made Feasible. In IEEE Symposium Series on Computational Intelligence, SSCI 2021, Orlando, FL, USA, December 5-7, 2021. pages 1-6, IEEE, 2021. [doi]

Abstract

Abstract is missing.