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]

Authors

Jing Liu

This author has not been identified. Look up 'Jing Liu' in Google

Hussein A. Abbass

This author has not been identified. Look up 'Hussein A. Abbass' in Google

David G. Green

This author has not been identified. Look up 'David G. Green' in Google

Weicai Zhong

This author has not been identified. Look up 'Weicai Zhong' in Google