Locating Infinite Discontinuities in Computer Experiments (Q3296927)

From MaRDI portal

Revision as of 09:34, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Locating Infinite Discontinuities in Computer Experiments	scientific article

Statements

scholarly article

0 references

Locating Infinite Discontinuities in Computer Experiments (English)

0 references

0 references

George Michailidis

0 references

Horace PakHai Lok

0 references

SIAM/ASA Journal on Uncertainty Quantification

0 references

publication date

2 July 2020

0 references

zbMATH Keywords

computer experiments

0 references

infinite discontinuity

0 references

active learning

0 references

support vector machines

0 references

quasi-Monte Carlo methods

0 references

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Queueing dynamics and maximal throughput scheduling in switched processing systems

0 references

Sequential Design with Mutual Information for Computer Experiments (MICE): Emulation of a Tsunami Model

0 references

Stability of queueing networks

0 references

Discrete particle swarm optimization for constructing uniform design on irregular regions

0 references

Contour estimation via two fidelity computer simulators under limited resources

0 references

Uniform design over general input domains with applications to target region estimation in computer experiments

0 references

Support-vector networks

0 references

Uniform Design: Theory and Application

0 references

0 references

Stochastic stability of jump linear systems

0 references

Multi-fidelity optimization via surrogate modelling

0 references

Boosting a weak learning algorithm by majority

0 references

A decision-theoretic generalization of on-line learning and an application to boosting

0 references

Bayesian Treed Gaussian Process Models With an Application to Computer Modeling

0 references

Scaled Gaussian Stochastic Process for Computer Model Calibration and Prediction

0 references

A generalized discrepancy and quadrature error bound

0 references

Model selection for support vector machines via uniform design

0 references

Dynamic scheduling for switched processing systems with substantial service-mode switching times

0 references

Stability and Control of Acyclic Stochastic Processing Networks With Shared Resources

0 references

Regression discontinuity designs: a guide to practice

0 references

Efficient emulators of computer experiments using compactly supported correlation functions, with an application to cosmology

0 references

Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel

0 references

Stability of queueing networks and scheduling policies

0 references

Optimized \(U\)-type designs on flexible regions

0 references

Bayesian Design and Analysis of Computer Experiments: Use of Derivatives in Surface Prediction

0 references

0 references

Design and analysis of computer experiments. With comments and a rejoinder by the authors

0 references

The design and analysis of computer experiments.

0 references

0 references

0 references

10.1162/153244302760185243

0 references

0 references

Hierarchical mixing linear support vector machines for nonlinear classification

0 references

full work available at URL

https://doi.org/10.1137/18m1209076

0 references

Identifiers

zbMATH Open document ID

0 references

10.1137/18M1209076

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3296927

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3296927&oldid=36905767"