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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.