Pages that link to "Item:Q4897080"
From MaRDI portal
The following pages link to An Exact Algorithm for Maximum Entropy Sampling (Q4897080):
Displaying 37 items.
- Solving maximum-entropy sampling problems using factored masks (Q868455) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems (Q1300266) (← links)
- A linear integer programming bound for maximum-entropy sampling (Q1411612) (← links)
- A note on maximizing a submodular set function subject to a knapsack constraint (Q1433658) (← links)
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint (Q1751212) (← links)
- Maximum-entropy sampling and the Boolean quadric polytope (Q1756791) (← links)
- Sensor selection for random field estimation in wireless sensor networks (Q1761385) (← links)
- Information gathering in Bayesian networks applied to petroleum prospecting (Q1789173) (← links)
- An outer-approximation approach for information-maximizing sensor selection (Q1947624) (← links)
- Systems of Gaussian process models for directed chains of solvers (Q1988026) (← links)
- Mixing convex-optimization bounds for maximum-entropy sampling (Q2044968) (← links)
- An R package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data (Q2225654) (← links)
- Spatial sampling design for parameter estimation of the covariance function (Q2386161) (← links)
- (Q2958605) (← links)
- Approximately optimal subset selection for statistical design and modelling (Q3389636) (← links)
- Continuous relaxations for Constrained Maximum-Entropy Sampling (Q4645926) (← links)
- Optimal Off-line Experimentation for Games (Q4991767) (← links)
- <i>k</i>-Submodular maximization with two kinds of constraints (Q5013487) (← links)
- Gaussian Process Landmarking for Three-Dimensional Geometric Morphometrics (Q5025782) (← links)
- (Q5053250) (← links)
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes (Q5076319) (← links)
- The Power of Subsampling in Submodular Maximization (Q5085145) (← links)
- Efficient Solution of Maximum-Entropy Sampling Problems (Q5144798) (← links)
- Sequential Design with Mutual Information for Computer Experiments (MICE): Emulation of a Tsunami Model (Q5741199) (← links)
- Mercer Kernels and Integrated Variance Experimental Design: Connections Between Gaussian Process Regression and Polynomial Approximation (Q5741201) (← links)
- Maximum expected entropy transformed Latin hypercube designs (Q5861463) (← links)
- Generalized maximum-entropy sampling (Q5882388) (← links)
- Maximum-entropy remote sampling (Q5929307) (← links)
- Spatial Sampling for Non‐compact Patterns (Q6088637) (← links)
- Tridiagonal maximum-entropy sampling and tridiagonal masks (Q6162032) (← links)
- An exact solution approach for the mobile multi‐agent sensing problem (Q6194842) (← links)
- An outer-approximation algorithm for maximum-entropy sampling (Q6202951) (← links)
- On the parameterized intractability of determinant maximization (Q6547207) (← links)
- Optimal experimental design: formulations and computations (Q6598420) (← links)
- Design of monitoring networks using \(k\)-determinantal point processes (Q6625891) (← links)
- Beyond symmetry: best submatrix selection for the sparse truncated SVD (Q6634519) (← links)