default search action
Matthias G. R. Faes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j11]Lukás Novák, Marcos A. Valdebenito
, Matthias G. R. Faes
On fractional moment estimation from polynomial chaos expansion. Reliab. Eng. Syst. Saf. 254: 110594 (2025) - 2024
- [j10]A. O. M. Kilicsoy
Sobolev Neural Network With Residual Weighting as a Surrogate in Linear and Non-Linear Mechanics. IEEE Access 12: 137144-137161 (2024) - [j9]Xiukai Yuan
Line sampling for time-variant failure probability estimation using an adaptive combination approach. Reliab. Eng. Syst. Saf. 243: 109885 (2024) - [i3]Lukás Novák, Marcos A. Valdebenito, Matthias G. R. Faes:
On Fractional Moment Estimation from Polynomial Chaos Expansion. CoRR abs/2403.01948 (2024) - [i2]A. O. M. Kilicsoy, J. Liedmann, Marcos A. Valdebenito, F.-J. Barthold, Matthias G. R. Faes:
Sobolev neural network with residual weighting as a surrogate in linear and non-linear mechanics. CoRR abs/2407.16466 (2024) - 2023
- [j8]Xiukai Yuan
Global failure probability function estimation based on an adaptive strategy and combination algorithm. Reliab. Eng. Syst. Saf. 231: 108937 (2023) - 2022
- [j7]Chao Dang
Parallel adaptive Bayesian quadrature for rare event estimation. Reliab. Eng. Syst. Saf. 225: 108621 (2022) - 2021
- [j6]Matthias G. R. Faes
Augmented reliability analysis for estimating imprecise first excursion probabilities in stochastic linear dynamics. Adv. Eng. Softw. 155: 102993 (2021) - [j5]Xiukai Yuan
Decoupled reliability-based optimization using Markov chain Monte Carlo in augmented space. Adv. Eng. Softw. 157-158: 103020 (2021) - [j4]Lechang Yang
On investigation of the Bayesian anomaly in multiple imprecise dependent information aggregation for system reliability evaluation. Int. J. Intell. Syst. 36(6): 2895-2921 (2021) - [j3]Xiukai Yuan
Efficient imprecise reliability analysis using the Augmented Space Integral. Reliab. Eng. Syst. Saf. 210: 107477 (2021) - [j2]Laura Bartsoen
Computationally Efficient Optimization Method to Quantify the Required Surgical Accuracy for a Ligament Balanced TKA. IEEE Trans. Biomed. Eng. 68(11): 3273-3280 (2021)
2010 – 2019
- 2019
- [j1]Matthias G. R. Faes
Hybrid spatial uncertainty analysis for the estimation of imprecise failure probabilities in Laser Sintered PA-12 parts. Comput. Math. Appl. 78(7): 2395-2406 (2019) - [c2]Lars Bogaerts, Matthias G. R. Faes, David Moens
A fast inverse approach for the quantification of set-theoretical uncertainty. SSCI 2019: 768-775 - 2017
- [c1]Matteo Broggi
Comparison of Bayesian and interval uncertainty quantification: Application to the AIRMOD test structure. SSCI 2017: 1-8 - 2016
- [i1]Matthias G. R. Faes, Wim Abbeloos, Frederik Vogeler, Hans Valkenaers, Kurt Coppens, Toon Goedemé, Eleonora Ferraris
Process Monitoring of Extrusion Based 3D Printing via Laser Scanning. CoRR abs/1612.02219 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 21:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: