The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Sequential Experiment Design for Contour Estimation From Complex Computer Codes
Abstract
Computer simulation often is used to study complex physical and engineering processes. Although a computer simulator often can be viewed as an inexpensive way to gain insight into a system, it still can be computationally costly. Much of the recent work on the design and analysis of computer experiments has focused on scenarios where the goal is to fit a response surface or process optimization. In this article we develop a sequential methodology for estimating a contour from a complex computer code. The approach uses a stochastic process model as a surrogate for the computer simulator. The surrogate model and associated uncertainty are key components in a new criterion used to identify the computer trials aimed specifically at improving the contour estimate. The proposed approach is applied to exploration of a contour for a network queuing system. Issues related to practical implementation of the proposed approach also are addressed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Garreau, G. A., & Rudin, W. (1987) · The Statistician · doi:10.2307/2348852 · Cited by 10,622
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
McKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
Design and Analysis of Computer Experiments
Sacks, J., Welch, W. J., Mitchell, T. J., & Wynn, H. P. (1989) · Statistical Science · doi:10.1214/ss/1177012413 · Cited by 6,919
McKay, M. D., Beckman, R. J., & Conover, W. J. (1979) · Technometrics · doi:10.2307/1268522 · Cited by 3,757
Level Set Methods and Fast Marching Methods
Sethian, J. A. (1999) · Medical Entomology and Zoology · Cited by 3,616
Practical Methods of Optimization.
Witzgall, C., & Fletcher, R. (1989) · Mathematics of Computation · doi:10.2307/2008742 · Cited by 3,591
Best Linear Unbiased Estimation and Prediction under a Selection Model
Henderson, C. R. (1975) · Biometrics · doi:10.2307/2529430 · Cited by 2,497
Cited by
The frontier of simulation-based inference
Cranmer, K., Brehmer, J., & Louppe, G. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1912789117 · Cited by 1,032
Sequential design of computer experiments for the estimation of a probability of failure
Bect, J., Ginsbourger, D., Li, L., Picheny, V., & Vazquez, E. (2012) · Statistics and Computing · doi:10.1007/s11222-011-9241-4 · Cited by 321
Adaptive Designs of Experiments for Accurate Approximation of a Target Region
Picheny, V., Ginsbourger, D., Roustant, O., Haftka, R. T., & Kim, N.-H. (2010) · Journal of Mechanical Design · doi:10.1115/1.4001873 · Cited by 291
Efficient surrogate models for reliability analysis of systems with multiple failure modes
Bichon, B. J., McFarland, J. M., & Mahadevan, S. (2011) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2011.05.008 · Cited by 290
Rare Event Estimation Using Polynomial-Chaos Kriging
Schöbi, R., Sudret, B., & Marelli, S. (2017) · ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part A: Civil Engineering · doi:10.1061/ajrua6.0000870 · Cited by 278
Metadata
- Authors
- Ranjan, P., Bingham, D., & Michailidis, G.
- Venue
- Technometrics
- Publisher
- Informa UK Limited
- Published
- 2008-11
- Volume
- 50
- Issue
- 4
- Pages
- 527-541
- ISSN
- 0040-1706 (ISSN-L)
- 1537-2723
- OpenAlex
- W2043653481
- Cited by
- 264
- References
- 26
- FWCI
- 17.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sequential Experiment Design for Contour Estimation From Complex Computer Codes. https://app.cochat.ai/papers/10.1198/004017008000000541
- The paper
- Ranjan, P., Bingham, D., & Michailidis, G. (2008). Sequential Experiment Design for Contour Estimation From Complex Computer Codes. Technometrics. https://doi.org/10.1198/004017008000000541
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.