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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Ander Gray' in GoogleThis author has not been identified. Look up 'Scott Ferson' in GoogleThis author has not been identified. Look up 'Olga Kosheleva' in GoogleThis author has not been identified. Look up 'Vladik Kreinovich' in Google

runs on WebDSL