<--- Back to Details
First PageDocument Content
Geometry / Mathematics / Decision theory / Computational statistics / Markov chain Monte Carlo / Multi-criteria decision analysis / Sampling / Gibbs sampling / Polytope / Statistics / Monte Carlo methods / Operations research
Date: 2013-12-04 08:48:47
Geometry
Mathematics
Decision theory
Computational statistics
Markov chain Monte Carlo
Multi-criteria decision analysis
Sampling
Gibbs sampling
Polytope
Statistics
Monte Carlo methods
Operations research

Hit-And-Run enables efficient weight generation for simulation-based multiple criteria decision analysis Tommi Tervonena,1 , Gert van Valkenhoefb,c,1,∗, Nalan Ba¸st¨ urka , Douwe Postmusc a Econometric

Add to Reading List

Source URL: drugis.org

Download Document from Source Website

File Size: 432,09 KB

Share Document on Facebook

Similar Documents

Introduction Prehistory State of the Art What Next ?  The Polytope Model: Past, Present, Future

Introduction Prehistory State of the Art What Next ? The Polytope Model: Past, Present, Future

DocID: 1u7wI - View Document

A C 1 Cross Polytope Macro-element in Four Variables Tatyana Sorokina Abstract. A C 1 macro-element in four variables is constructed based on a split of a cross polytope into sixteen simplices. The element uses

A C 1 Cross Polytope Macro-element in Four Variables Tatyana Sorokina Abstract. A C 1 macro-element in four variables is constructed based on a split of a cross polytope into sixteen simplices. The element uses

DocID: 1sSQZ - View Document

SUM OF SQUARES CERTIFICATES FOR CONTAINMENT OF H-POLYTOPES IN V-POLYTOPES KAI KELLNER AND THORSTEN THEOBALD Abstract. Given an H-polytope P and a V-polytope Q, the decision problem whether P is contained in Q is co-NP-co

SUM OF SQUARES CERTIFICATES FOR CONTAINMENT OF H-POLYTOPES IN V-POLYTOPES KAI KELLNER AND THORSTEN THEOBALD Abstract. Given an H-polytope P and a V-polytope Q, the decision problem whether P is contained in Q is co-NP-co

DocID: 1sIuk - View Document

CONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. We study the computational question whether a given polytope or spectrahedron SA (as given by the posit

CONTAINMENT PROBLEMS FOR POLYTOPES AND SPECTRAHEDRA KAI KELLNER, THORSTEN THEOBALD, AND CHRISTIAN TRABANDT Abstract. We study the computational question whether a given polytope or spectrahedron SA (as given by the posit

DocID: 1sdVi - View Document

Lasso Screening Rules via Dual Polytope Projection (Supplemental Material

Lasso Screening Rules via Dual Polytope Projection (Supplemental Material

DocID: 1s915 - View Document