Publication Details
Title: General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms
Author: J. Laessig and D. Sudholt
Group: Algorithms
Date: September 2010
PDF: [Not available online]
Acknowledgements:
This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through a postdoctoral fellowship.
Bibliographic Information:
Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN 2010), Krakow, Poland, pp. 234-243
Bibliographic Reference:
J. Laessig and D. Sudholt. General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms. Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN 2010), Krakow, Poland, pp. 234-243, September 2010
Author: J. Laessig and D. Sudholt
Group: Algorithms
Date: September 2010
PDF: [Not available online]
Acknowledgements:
This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through a postdoctoral fellowship.
Bibliographic Information:
Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN 2010), Krakow, Poland, pp. 234-243
Bibliographic Reference:
J. Laessig and D. Sudholt. General Scheme for Analyzing Running Times of Parallel Evolutionary Algorithms. Proceedings of the 11th International Conference on Parallel Problem Solving from Nature (PPSN 2010), Krakow, Poland, pp. 234-243, September 2010