Branch and bound algorithms for maximizing expected improvement functions (Q710752)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Branch and bound algorithms for maximizing expected improvement functions |
scientific article; zbMATH DE number 5804336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch and bound algorithms for maximizing expected improvement functions |
scientific article; zbMATH DE number 5804336 |
Statements
Branch and bound algorithms for maximizing expected improvement functions (English)
0 references
22 October 2010
0 references
computer experiments
0 references
feature estimation
0 references
0 references
0 references
0 references
0.7647405862808228
0 references
0.7612245678901672
0 references
0.730582058429718
0 references
0.7292885184288025
0 references
