Exploring stochasticity and imprecise knowledge based on linear inequality constraints
From MaRDI portal
Publication:314508
DOI10.1007/S00285-015-0959-ZzbMATH Open1346.92079OpenAlexW2222645259WikidataQ46613316 ScholiaQ46613316MaRDI QIDQ314508FDOQ314508
Ulf Lindstrรถm, Sam Subbey, Benjamin Planque
Publication date: 16 September 2016
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00285-015-0959-z
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Optimization
- Monte Carlo methods in Bayesian computation
- Sufficient burn-in for Gibbs samplers for a hierarchical random effects model.
- Hit-and-run mixes fast
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Testing inequality constraints in linear econometric models
- A Laplace transform algorithm for the volume of a convex polytope
- On the Complexity of Computing the Volume of a Polyhedron
- Handbook of Monte Carlo Methods
- A Bayesian method for linear, inequality-constrained adjustment and its application to GPS positioning
- General hit-and-run Monte Carlo sampling for evaluating multidimensional integrals
- Direction choice for accelerated convergence in hit-and-run sampling
- Volume Computation Using a Direct Monte Carlo Method
- Convergence properties of hitโandโrun samplers
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- Time varying VARs with inequality restrictions
- Inequality Restrictions in Regression Analysis
- Gaussian polytopes: variances and limit theorems
Cited In (1)
Recommendations
- Title not available (Why is that?) ๐ ๐
- Toward a perception-based theory of probabilistic reasoning with imprecise probabilities ๐ ๐
- Probabilistic satisfiability with imprecise probabilities ๐ ๐
- Extending uncertainty formalisms to linear constraints and other complex formalisms ๐ ๐
- Inconsistency-tolerant reasoning over linear probabilistic knowledge bases ๐ ๐
- Learning imprecise probability models: conceptual and practical challenges ๐ ๐
- Expressing imprecision in probabilistic knowledge ๐ ๐
- Structural properties of linear probabilistic constraints ๐ ๐
- Confidence-based reasoning in stochastic constraint programming ๐ ๐
This page was built for publication: Exploring stochasticity and imprecise knowledge based on linear inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314508)