The following pages link to (Q4003879):
Displaying 50 items.
- Minimax and Minimax Projection Designs Using Clustering (Q123949) (← links)
- Projection pursuit based tests of normality with functional data (Q135088) (← links)
- Permutation p-value approximation via generalized Stolarsky invariance (Q151862) (← links)
- Linear difference equations and periodic sequences over finite fields (Q255690) (← links)
- Quasi-Monte Carlo integration using digital nets with antithetics (Q273389) (← links)
- \(L_{2}\) discrepancy of symmetrized generalized hammersley point sets in base \(b\) (Q273467) (← links)
- On the lower bound of the discrepancy of \((t, s)\) sequences. I (Q282846) (← links)
- Very low truncation dimension for high dimensional integration under modest error demand (Q290796) (← links)
- A sparse grid stochastic collocation method for elliptic interface problems with random input (Q293115) (← links)
- The acceptance-rejection method for low-discrepancy sequences (Q293509) (← links)
- Linear complexity of the \(x^{2} \bmod p\) orbits (Q294691) (← links)
- Mixed orthogonal arrays, \((u,m,\mathbf{e},s)\)-nets, and \((u,\mathbf{e},s)\)-sequences (Q297905) (← links)
- On the linear complexity profile of some sequences derived from elliptic curves (Q306337) (← links)
- Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions (Q306699) (← links)
- An auto-realignment method in quasi-Monte Carlo for pricing financial derivatives with jump structures (Q323335) (← links)
- An empirical analysis of scenario generation methods for stochastic optimization (Q323497) (← links)
- Low-discrepancy sampling for approximate dynamic programming with local approximators (Q336896) (← links)
- Highly efficient numerical algorithm based on random trees for accelerating parallel Vlasov-Poisson simulations (Q340902) (← links)
- Analysis of the domain mapping method for elliptic diffusion problems on random domains (Q342894) (← links)
- A search for extensible low-WAFOM point sets (Q350301) (← links)
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints (Q367165) (← links)
- Scenario approximation of robust and chance-constrained programs (Q368719) (← links)
- Expected residual minimization method for stochastic variational inequality problems with nonlinear perturbations (Q371551) (← links)
- The \(p\)-adic diaphony of the Halton sequence (Q372728) (← links)
- New star discrepancy bounds for \((t,m,s)\)-nets and \((t,s)\)-sequences (Q372815) (← links)
- Numerical integration in statistical decision-theoretic methods for robust design optimization (Q373980) (← links)
- Multidimensional quasi-Monte Carlo Malliavin Greeks (Q377789) (← links)
- Approximately uniform online checkpointing with bounded memory (Q378218) (← links)
- Estimation of spectral bounds in gradient algorithms (Q385581) (← links)
- Sample average approximation method for a class of stochastic generalized Nash equilibrium problems (Q390493) (← links)
- On the error term of the logarithm of the lcm of a quadratic sequence (Q394272) (← links)
- Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy (Q398623) (← links)
- A dynamically bi-orthogonal method for time-dependent stochastic partial differential equations. II: Adaptivity and generalizations (Q401601) (← links)
- A dynamically bi-orthogonal method for time-dependent stochastic partial differential equations. I: Derivation and algorithms (Q401608) (← links)
- A numerical method for two-stage stochastic programs under uncertainty (Q410561) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Constructing uniform designs: A heuristic integer programming method (Q413474) (← links)
- How do path generation methods affect the accuracy of quasi-Monte Carlo methods for problems in finance? (Q413476) (← links)
- A construction of digital \((0,s)\)-sequences involving finite-row generator matrices (Q413562) (← links)
- Variance bounds and existence results for randomly shifted lattice rules (Q421840) (← links)
- Metrical results on the discrepancy of Halton-Kronecker sequences (Q431282) (← links)
- Modeling the random effects covariance matrix for generalized linear mixed models (Q434920) (← links)
- Statistical measures of two dimensional point set uniformity (Q435027) (← links)
- Quasi-Monte Carlo rules for numerical integration over the unit sphere \({\mathbb{S}^2}\) (Q443857) (← links)
- How slowly can a bounded sequence cluster? (Q449608) (← links)
- Accurate emulators for large-scale computer experiments (Q449978) (← links)
- Low discrepancy polynomial lattice point sets (Q452386) (← links)
- The AEP algorithm for the fast computation of the distribution of the sum of dependent random variables (Q453289) (← links)
- A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights (Q458162) (← links)
- Adaptive-sparse polynomial dimensional decomposition methods for high-dimensional stochastic computing (Q459298) (← links)
