Motif difficulty (MD): A predictive measure of problem difficulty for evolutionary algorithms using network motifs

Jing Liu, Hussein Aly Abbass, David Geoffrey Green, Weicai Zhong

Research output: Contribution to journal › Article › Research › peer-review

Access to Document

@article{1b73fe953b57466ab16b22f9c4c05ac3,

title = "Motif difficulty (MD): A predictive measure of problem difficulty for evolutionary algorithms using network motifs",

author = "Jing Liu and Abbass, {Hussein Aly} and Green, {David Geoffrey} and Weicai Zhong",

year = "2012",

doi = "10.1162/EVCO_a_00045",

language = "English",

volume = "20",

pages = "321 -- 347",

journal = "Evolutionary Computation",

issn = "1063-6560",

publisher = "MIT Press - Journals",

number = "3",

}

TY - JOUR

T1 - Motif difficulty (MD): A predictive measure of problem difficulty for evolutionary algorithms using network motifs

AU - Liu, Jing

AU - Abbass, Hussein Aly

AU - Green, David Geoffrey

AU - Zhong, Weicai

PY - 2012

Y1 - 2012

U2 - 10.1162/EVCO_a_00045

DO - 10.1162/EVCO_a_00045

M3 - Article

SN - 1063-6560

VL - 20

SP - 321

EP - 347

JO - Evolutionary Computation

JF - Evolutionary Computation

IS - 3

ER -