The Bayesian Search Game (Q3459677)

From MaRDI portal

Revision as of 08:04, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

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

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The Bayesian Search Game	scientific article

Statements

scholarly article

0 references

The Bayesian Search Game (English)

0 references

0 references

Theory and Principled Methods for the Design of Metaheuristics

0 references

publication date

11 January 2016

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-33206-7_7

0 references

Continuous lunches are free plus the design of optimal optimization algorithms

0 references

A radial basis function method for global optimization

0 references

A no-free-lunch theorem for non-uniform distributions of target functions

0 references

Efficient global optimization of expensive black-box functions

0 references

A taxonomy of global optimization methods based on response surfaces

0 references

0 references

0 references

Compact representations as a search strategy: compression EDAs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-33206-7_7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3459677

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