A note on problem difficulty measures in black-box optimization: classification, realizations and predictability

He, J ORCID: https://orcid.org/0000-0002-5616-4691, Reeves, C, Witt, C and Yao, X, 2007. A note on problem difficulty measures in black-box optimization: classification, realizations and predictability. Evolutionary Computation, 15 (4), pp. 435-443. ISSN 1063-6560

Full text not available from this repository.

Item Type:	Journal article
Publication Title:	Evolutionary Computation
Creators:	He, J., Reeves, C., Witt, C. and Yao, X.
Publisher:	MIT Press
Date:	December 2007
Volume:	15
Number:	4
ISSN:	1063-6560
Identifiers:	Number Type 10.1162/evco.2007.15.4.435 DOI 1262236 Other
Divisions:	Schools > School of Science and Technology
Record created by:	Jill Tomkinson
Date Added:	16 Jan 2020 11:06
Last Modified:	16 Jan 2020 11:06
URI:	https://irep.ntu.ac.uk/id/eprint/38988

Actions (login required)

Edit View

Statistics

Views

Downloads