<--- Back to Details
First PageDocument Content
Mathematical analysis / Database management systems / SQL / Optimal control / Pareto efficiency / Convex polytope / Multi-objective optimization / Polytope / Query optimizer / Mathematical optimization / Operations research / Mathematics
Date: 2014-10-10 16:41:14
Mathematical analysis
Database management systems
SQL
Optimal control
Pareto efficiency
Convex polytope
Multi-objective optimization
Polytope
Query optimizer
Mathematical optimization
Operations research
Mathematics

Multi-Objective Parametric Query Optimization Immanuel Trummer and Christoph Koch {firstname}.{lastname}@epfl.ch ´ Ecole Polytechnique Fed

Add to Reading List

Source URL: www.vldb.org

Download Document from Source Website

File Size: 226,62 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