C.Schumacher (2000) Black Box Search - Framework and Methods. PhD. thesis, The University of Tennessee, Knoxville. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Evolutionary Algorithms In Discrete Optimisation - Eremeev, Reeves (Correct)
....problem (except for its dimensionality) is accessible only through evaluations of objective function in the sample points. This raises the issue of evaluation and comparison of different algorithms in such a black box optimisation scenario, which is currently being intensively studied (see e.g. [20,24]) Dynamical system model and the local optima structure. Several workers (see e.g. 1] have pointed out that in the GA on Boolean solutions space X = f0; 1g mutation is strongly connected to the local optima structure defined by Hamming distance: the effect of mutation at typical rates is ....
C.Schumacher (2000) Black Box Search - Framework and Methods. PhD. thesis, The University of Tennessee, Knoxville.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC