Abstract
The empirical results of the last chapter were tantalizing. Easy and hard problems were automatically solved without user intervention in polynomial time. This raises an important question: How is BOA going to perform on other problems of bounded difficulty?
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
About this chapter
Cite this chapter
Pelikan, M. Scalability Analysis. In: Hierarchical Bayesian Optimization Algorithm. Studies in Fuzziness and Soft Computing, vol 170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32373-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-32373-0_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23774-7
Online ISBN: 978-3-540-32373-0
eBook Packages: EngineeringEngineering (R0)