Predict the success or failure of an evolutionary algorithm run

Gopinath Chennupati, Conor Ryan, Raja Muhammad Atif Azad · 2014

The quality of candidate solutions in evolutionary computation (EC) depend on multiple independent runs and a large number of them fail to guarantee optimal result. These runs consume more or less equal or sometimes higher amount of computational resources on par the runs that produce desirable results.

Read the paper · More papers on PaperTik