Motif Difficulty (MD): A Predictive Measure of Problem Difficulty for Evolutionary Algorithms Using Network Motifs

Jing Liu, Hussein A. Abbass, David G. Green, Weicai Zhong. Motif Difficulty (MD): A Predictive Measure of Problem Difficulty for Evolutionary Algorithms Using Network Motifs. Evolutionary Computation, 20(3):321-347, 2012. [doi]

@article{LiuAGZ12,
  title = {Motif Difficulty (MD): A Predictive Measure of Problem Difficulty for Evolutionary Algorithms Using Network Motifs},
  author = {Jing Liu and Hussein A. Abbass and David G. Green and Weicai Zhong},
  year = {2012},
  doi = {10.1162/EVCO_a_00045},
  url = {http://dx.doi.org/10.1162/EVCO_a_00045},
  researchr = {https://researchr.org/publication/LiuAGZ12},
  cites = {0},
  citedby = {0},
  journal = {Evolutionary Computation},
  volume = {20},
  number = {3},
  pages = {321-347},
}