Optimal computing budget allocation for small computing budgets

LaPorte, G. Jake
Branke, Jürgen
Chen, Chun-Hung

Publication date

January 2012

DOI

10.1109/WSC.2012.6465085

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Abstract

In this paper, we develop an optimal computing budget allocation (OCBA) algorithm for selecting a subset of designs under the restriction of an extremely small computing budget. Such an algorithm is useful in population based Evolutionary Algorithms (EA) and other applications that seek an elite subset of designs

Extracted data

We use cookies to provide a better user experience.

Data Protection

Optimal computing budget allocation for small computing budgets

Abstract

Extracted data

Optimal computing budget allocation for small computing budgets

Abstract

Extracted data

Related items

Related items