The following pages link to Jasper De Bock (Q257058):
Displaying 32 items.
- Robust queueing theory: an initial study using imprecise probabilities (Q257060) (← links)
- Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems (Q312991) (← links)
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach (Q473383) (← links)
- The limit behaviour of imprecise continuous-time Markov chains (Q525496) (← links)
- Extreme lower previsions (Q743181) (← links)
- Conditioning, updating and lower probability zero (Q900364) (← links)
- (Q1699328) (redirect page) (← links)
- Representation theorems for partially exchangeable random variables (Q1699331) (← links)
- Independent natural extension for infinite spaces (Q1726321) (← links)
- Game-theoretic upper expectations for discrete-time finite-state uncertain processes (Q2050862) (← links)
- Randomness is inherently imprecise (Q2069032) (← links)
- On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness (Q2105577) (← links)
- The smallest probability interval a sequence is random for: a study for six types of randomness (Q2146046) (← links)
- Markovian imprecise jump processes: extension to measurable variables, convergence theorems and algorithms (Q2152515) (← links)
- A particular upper expectation as global belief model for discrete-time finite-state uncertain processes (Q2237138) (← links)
- Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity (Q2237163) (← links)
- A recursive algorithm for computing inferences in imprecise Markov chains (Q2297800) (← links)
- Bounding inferences for large-scale continuous-time Markov chains: a new approach based on lumping and imprecise Markov chains (Q2302810) (← links)
- Computing lower and upper expected first-passage and return times in imprecise birth-death chains (Q2374517) (← links)
- Credal networks under epistemic irrelevance (Q2409105) (← links)
- Imprecise continuous-time Markov chains (Q2411281) (← links)
- A behavioural justification for using sensitivity analysis in imprecise multinomial processes (Q2414018) (← links)
- Robustifying the Viterbi Algorithm (Q2938403) (← links)
- Coherent Predictive Inference under Exchangeability with Imprecise Probabilities (Q2940590) (← links)
- Imprecise Bernoulli Processes (Q3143418) (← links)
- (Q3457197) (← links)
- Exploiting Bayesian network sensitivity functions for inference in credal networks (Q4576196) (← links)
- Optimal control of a linear system subject to partially specified input noise (Q5241718) (← links)
- Predictive Inference Under Exchangeability, and the Imprecise Dirichlet Multinomial Model (Q5266575) (← links)
- Extreme Lower Previsions and Minkowski Indecomposability (Q5326415) (← links)
- An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models (Q5419480) (← links)
- Characterizing Dirichlet Priors (Q5884406) (← links)
