The Bayesian Search Game
From MaRDI portal
Publication:3459677
DOI10.1007/978-3-642-33206-7_7zbMath1328.90169OpenAlexW118209859MaRDI QIDQ3459677
Publication date: 11 January 2016
Published in: Theory and Principled Methods for the Design of Metaheuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33206-7_7
Gaussian processes (60G15) Approximation methods and heuristics in mathematical programming (90C59) Markov and semi-Markov decision processes (90C40)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Continuous lunches are free plus the design of optimal optimization algorithms
- Efficient global optimization of expensive black-box functions
- A no-free-lunch theorem for non-uniform distributions of target functions
- A taxonomy of global optimization methods based on response surfaces
- Compact representations as a search strategy: compression EDAs
- A radial basis function method for global optimization
This page was built for publication: The Bayesian Search Game