Abstract
This paper presents principled results demonstrating how the identification and exploitation of variable dependencies by means of Artificial Neural Network powered online model building, combined with a model based local-search, opens the way towards large-scale optimization of hard, non-separable building-block problems. © 2008 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Iclǎnzan, D., & Dumitrescu, D. (2008). Large-scale optimization of non-separable building-block problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5199 LNCS, pp. 899–908). Springer Verlag. https://doi.org/10.1007/978-3-540-87700-4_89
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
