4 research outputs found

    Co-optimization: a generalization of coevolution

    Get PDF
    Many problems encountered in computer science are best stated in terms of interactions amongst individuals. For example, many problems are most naturally phrased in terms of finding a candidate solution which performs best against a set of test cases. In such situations, methods are needed to find candidate solutions which are expected to perform best over all test cases. Coevolution holds the promise of addressing such problems by employing principles from biological evolution, where populations of candidate solutions and test cases are evolved over time to produce higher quality solutions...This thesis presents a generalization of coevolution to co-optimization, where optimization techniques that do not rely on evolutionary principles may be used. Instead of introducing a new addition to coevolution in order to make it better suited for a particular class of problems, this thesis suggests removing the evolutionary model in favor of a technique better suited for that class of problems --Abstract, page iii

    Adaptive Peircean decision aid project summary assessments.

    Full text link

    Learning the Ideal Evaluation Function

    No full text
    Designing an adequate fitness function requires substantial knowledge of a problem and of features that indicate progress towards a solution
    corecore