Your search returned 5 results.

Results
	1.	Tight analysis of the (1+1)-EA for the single source shortest path problem. [electronic resource] by Doerr, Benjamin Happ, Edda Klein, Christian Producer: 20120307 In: Evolutionary computation vol. 19 Online resources: Available from publisher's website Availability: No items available. Save to lists Add to cart (remove)
	2.	Unbiased Black-Box Complexities of Jump Functions. [electronic resource] by Doerr, Benjamin Doerr, Carola Kötzing, Timo Producer: 20160926 In: Evolutionary computation vol. 23 Online resources: Available from publisher's website Availability: No items available. Save to lists Add to cart (remove)
	3.	Speeding up evolutionary algorithms through asymmetric mutation operators. [electronic resource] by Doerr, Benjamin Hebbinghaus, Nils Neumann, Frank Producer: 20080122 In: Evolutionary computation vol. 15 Online resources: Available from publisher's website Availability: No items available. Save to lists Add to cart (remove)
	4.	The Unrestricted Black-Box Complexity of Jump Functions. [electronic resource] by Buzdalov, Maxim Doerr, Benjamin Kever, Mikhail Producer: 20170509 In: Evolutionary computation vol. 24 Online resources: Available from publisher's website Availability: No items available. Save to lists Add to cart (remove)
	5.	Mutation rate matters even when optimizing monotonic functions. [electronic resource] by Doerr, Benjamin Jansen, Thomas Sudholt, Dirk Winzen, Carola Zarges, Christine Producer: 20130910 In: Evolutionary computation vol. 21 Online resources: Available from publisher's website Availability: No items available. Save to lists Add to cart (remove)