A coevolution archive based on problem dimension | Zendy

Liping Yang | Zendy; Houkuan Huang | Zendy; Liu Ya-bin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A coevolution archive based on problem dimension

Author(s) -

Liping Yang,

Houkuan Huang,

Liu Ya-bin

Publication year - 2008

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1145/1389095.1389167

Subject(s) - coevolution , dimension (graph theory) , monotonic function , computer science , scheme (mathematics) , theoretical computer science , mathematical optimization , artificial intelligence , mathematics , combinatorics , mathematical analysis , paleontology , biology

Recent work has shown the existence of an implicit dimension structure within coevolution problems, which can uniquely determine the overall performance of a individual. In this paper, we present a reliable dimension identifying method. Based on this , we put forward a suitable archive scheme, which maintains only the most representative individuals in terms of problem dimensional information identified during coevolution, and achieves minimum size while guaranteeing monotonic progress. The experimental results on COMPARE-ON-ONE and COMPARE-ON-ALL demonstrate the viability of the algorithm

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research