default search action
Matthias C. M. Troffaes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j22]Tathagata Basu
, Matthias C. M. Troffaes:
Robust Bayesian causal estimation for causal inference in medical diagnosis. Int. J. Approx. Reason. 177: 109330 (2025) - 2024
- [j21]Nawapon Nakharutai, Sébastien Destercke
Regret-based budgeted decision rules under severe uncertainty. Inf. Sci. 665: 120361 (2024) - [c21]Nawapon Nakharutai
Elicitation for Decision Problems Under Severe Uncertainties. SUM 2024: 312-324 - 2023
- [c20]Tathagata Basu
A Robust Bayesian Approach for Causal Inference Problems. ECSQARU 2023: 359-371 - [c19]Matthias C. M. Troffaes:
A nonstandard approach to stochastic processes under probability bounding. ISIPTA 2023: 450-460 - [i3]Mohammad Rajabdorri, Lukas Sigrist, Enrique Lobato, Matthias C. M. Troffaes, Behzad Kazemtabrizi:
Data-driven Estimation of Under Frequency Load Shedding after Outages in Small Power Systems. CoRR abs/2312.11389 (2023) - 2022
- [j20]Ivette Raices Cruz, Johan Lindström
Iterative importance sampling with Markov chain Monte Carlo sampling in robust Bayesian analysis. Comput. Stat. Data Anal. 176: 107558 (2022) - [c18]Nawapon Nakharutai
Decision Making Under Severe Uncertainty on a Budget. SUM 2022: 186-201 - [i2]Mohammad Rajabdorri, Behzad Kazemtabrizi, Matthias C. M. Troffaes, Lukas Sigrist, Enrique Lobato:
Inclusion of Frequency Nadir constraint in the Unit Commitment Problem of Small Power Systems Using Machine Learning. CoRR abs/2210.01540 (2022) - 2021
- [j19]Nawapon Nakharutai
Improving and benchmarking of algorithms for Γ-maximin, Γ-maximax and interval dominance. Int. J. Approx. Reason. 133: 95-115 (2021) - [c17]Nawapon Nakharutai, Matthias C. M. Troffaes:
Improving Algorithms for Decision Making with the Hurwicz Criterion. ISIPTA 2021: 235-243 - 2020
- [c16]Tathagata Basu
Binary Credal Classification Under Sparsity Constraints. IPMU (2) 2020: 82-95
2010 – 2019
- 2019
- [j18]Nawapon Nakharutai, Camila C. S. Caiado
Evaluating betting odds and free coupons using desirability. Int. J. Approx. Reason. 106: 128-145 (2019) - [j17]Nawapon Nakharutai, Matthias C. M. Troffaes
Improving and benchmarking of algorithms for decision making with lower previsions. Int. J. Approx. Reason. 113: 91-105 (2019) - [c15]Matthias C. M. Troffaes, Tathagata Basu:
A Cantelli-Type Inequality for Constructing Non-Parametric P-Boxes Based on Exchangeability. ISIPTA 2019: 386-393 - [c14]Matthias C. M. Troffaes, Thomas E. Krak, Henna Bains:
Two-State Imprecise Markov Chains for Statistical Modelling of Two-State Non-Markovian Processes. ISIPTA 2019: 394-403 - [i1]Nawapon Nakharutai, Matthias C. M. Troffaes
Improving and benchmarking of algorithms for decision making with lower previsions. CoRR abs/1906.12215 (2019) - 2018
- [j16]Matthias C. M. Troffaes
Imprecise Monte Carlo simulation and iterative importance sampling for the estimation of lower previsions. Int. J. Approx. Reason. 101: 31-48 (2018) - [j15]Nawapon Nakharutai, Matthias C. M. Troffaes
Improved linear programming methods for checking avoiding sure loss. Int. J. Approx. Reason. 101: 293-310 (2018) - 2017
- [c13]Evelyn Heylen
Qualitative comparison of techniques for evaluating performance of short term power system reliability management. ISGT Europe 2017: 1-6 - [c12]Nawapon Nakharutai, Matthias C. M. Troffaes, Camila C. S. Caiado:
Efficient Algorithms for Checking Avoiding Sure Loss. ISIPTA 2017: 241-252 - [c11]Matthias C. M. Troffaes:
A Note on Imprecise Monte Carlo over Credal Sets via Importance Sampling. ISIPTA 2017: 325-332 - [c10]Matthias C. M. Troffaes, Ullrika Sahlin:
Imprecise Swing Weighting for Multi-Attribute Utility Elicitation Based on Partial Preferences. ISIPTA 2017: 333-345 - 2015
- [j14]Enrique Miranda
A geometric and game-theoretic study of the conjunction of possibility measures. Inf. Sci. 298: 373-389 (2015) - 2014
- [j13]Matthias C. M. Troffaes
A robust Bayesian approach to modeling epistemic uncertainty in common-cause failure models. Reliab. Eng. Syst. Saf. 125: 13-21 (2014) - [c9]Lewis Paton, Matthias C. M. Troffaes
Multinomial Logistic Regression on Markov Chains for Crop Rotation Modelling. IPMU (3) 2014: 476-485 - [c8]Matthias C. M. Troffaes
A Note on Learning Dependence under Severe Uncertainty. IPMU (3) 2014: 498-507 - 2013
- [j12]Matthias C. M. Troffaes
On the connection between probability boxes and possibility measures. Inf. Sci. 224: 88-108 (2013) - 2012
- [j11]Nathan Huntley, Matthias C. M. Troffaes
Normal form backward induction for decision trees with coherent lower previsions. Ann. Oper. Res. 195(1): 111-134 (2012) - [j10]Matthias C. M. Troffaes
Robust detection of exotic infectious diseases in animal herds: A comparative study of three decision methodologies under severe uncertainty. Int. J. Approx. Reason. 53(8): 1271-1281 (2012) - 2011
- [j9]Matthias C. M. Troffaes
Probability boxes on totally preordered spaces for multivariate modelling. Int. J. Approx. Reason. 52(6): 767-791 (2011) - [c7]Matthias C. M. Troffaes
On the connection between probability boxes and possibility measures. EUSFLAT Conf. 2011: 836-843 - [r1]Frank P. A. Coolen, Matthias C. M. Troffaes
Imprecise Probability. International Encyclopedia of Statistical Science 2011: 645-648 - 2010
- [j8]Thomas Augustin, Frank P. A. Coolen, Serafín Moral, Matthias C. M. Troffaes
Imprecise probability in statistical inference and decision making. Int. J. Approx. Reason. 51(9): 1011-1013 (2010) - [c6]Matthias C. M. Troffaes
Sequential Decision Processes under Act-State Independence with Arbitrary Choice Functions. IPMU (1) 2010: 98-107
2000 – 2009
- 2009
- [j7]Matthias C. M. Troffaes
Applying the imprecise Dirichlet model in cases with partial observations and dependencies in failure data. Int. J. Approx. Reason. 50(2): 257-268 (2009) - [j6]Matthias C. M. Troffaes
Finite approximations to coherent choice. Int. J. Approx. Reason. 50(4): 655-665 (2009) - 2008
- [c5]Enrique Miranda
Generalised p-Boxes on Totally Ordered Spaces. SMPS 2008: 235-242 - [c4]Nathan Huntley, Matthias C. M. Troffaes
An Efficient Normal Form Solution to Decision Trees with Lower Previsions. SMPS 2008: 419-426 - 2007
- [j5]Matthias C. M. Troffaes
Decision making under uncertainty using imprecise probabilities. Int. J. Approx. Reason. 45(1): 17-29 (2007) - 2006
- [j4]Matthias C. M. Troffaes
Generalizing the conjunction rule for aggregating conflicting expert opinions. Int. J. Intell. Syst. 21(3): 361-380 (2006) - [c3]Matthias C. M. Troffaes
Conditional Lower Previsions for Unbounded Random Quantities. SMPS 2006: 201-209 - 2005
- [j3]Gert de Cooman
Dynamic programming for deterministic discrete-time systems with uncertain gain. Int. J. Approx. Reason. 39(2-3): 257-278 (2005) - [j2]Gert de Cooman, Matthias C. M. Troffaes, Enrique Miranda:
n-Monotone lower previsions. J. Intell. Fuzzy Syst. 16(4): 253-263 (2005) - [c2]Gert de Cooman, Matthias C. M. Troffaes, Enrique Miranda:
n-Monotone Lower Previsions and Lower Integrals. ISIPTA 2005: 145-154 - 2004
- [j1]Gert de Cooman
Coherent lower previsions in systems modelling: products and aggregation rules. Reliab. Eng. Syst. Saf. 85(1-3): 113-134 (2004) - 2003
- [c1]Gert de Cooman, Matthias C. M. Troffaes:
Dynamic Programming for Discrete-Time Systems with Uncertain Gain. ISIPTA 2003: 162-176
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-23 20:28 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: