Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Benjamin Doerr
Nils Hebbinghaus
Frank Neumann

Evolutionary computation

Showing results (1-10 of 26) with videos related to

Pageof 3
Sort By:
Evolutionary Computation|November 21, 2007
Speeding up evolutionary algorithms through asymmetric mutation operatorsBenjamin Doerr, Nils Hebbinghaus, Frank Neumann
Evolutionary Computation|June 30, 2010
Approximating covering problems by randomized search heuristics using multi-objective modelsTobias Friedrich, Jun He, Nils Hebbinghaus, et al.
Evolutionary Computation|February 12, 2009
Analyses of simple hybrid algorithms for the vertex cover problemTobias Friedrich, Jun He, Nils Hebbinghaus, et al.
Evolutionary Computation|November 16, 2020
Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative DriftBenjamin Doerr
Evolutionary Computation|April 6, 2023
Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal ObjectivesWeijie Zheng, Benjamin Doerr
Evolutionary Computation|October 8, 2021
The Univariate Marginal Distribution Algorithm Copes Well with Deception and EpistasisBenjamin Doerr, Martin S Krejca
Evolutionary Computation|August 16, 2011
Tight analysis of the (1+1)-EA for the single source shortest path problemBenjamin Doerr, Edda Happ, Christian Klein
Evolutionary Computation|June 1, 2016
The Unrestricted Black-Box Complexity of Jump FunctionsMaxim Buzdalov, Benjamin Doerr, Mikhail Kever
Evolutionary Computation|July 3, 2015
Unbiased Black-Box Complexities of Jump FunctionsBenjamin Doerr, Carola Doerr, Timo Kötzing
Evolutionary Computation|July 3, 2015
Maximizing Submodular Functions under Matroid Constraints by Evolutionary AlgorithmsTobias Friedrich, Frank Neumann
Pageof 3

Showing results (1-10 of 26) with videos related to

Sort By:
Pageof 3
Evolutionary Computation|November 21, 2007
Speeding up evolutionary algorithms through asymmetric mutation operatorsBenjamin Doerr, Nils Hebbinghaus, Frank Neumann
Evolutionary Computation|June 30, 2010
Approximating covering problems by randomized search heuristics using multi-objective modelsTobias Friedrich, Jun He, Nils Hebbinghaus, et al.
Evolutionary Computation|February 12, 2009
Analyses of simple hybrid algorithms for the vertex cover problemTobias Friedrich, Jun He, Nils Hebbinghaus, et al.
Evolutionary Computation|November 16, 2020
Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative DriftBenjamin Doerr
Evolutionary Computation|April 6, 2023
Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal ObjectivesWeijie Zheng, Benjamin Doerr
Evolutionary Computation|October 8, 2021
The Univariate Marginal Distribution Algorithm Copes Well with Deception and EpistasisBenjamin Doerr, Martin S Krejca
Evolutionary Computation|August 16, 2011
Tight analysis of the (1+1)-EA for the single source shortest path problemBenjamin Doerr, Edda Happ, Christian Klein
Evolutionary Computation|June 1, 2016
The Unrestricted Black-Box Complexity of Jump FunctionsMaxim Buzdalov, Benjamin Doerr, Mikhail Kever
Evolutionary Computation|July 3, 2015
Unbiased Black-Box Complexities of Jump FunctionsBenjamin Doerr, Carola Doerr, Timo Kötzing
Evolutionary Computation|July 3, 2015
Maximizing Submodular Functions under Matroid Constraints by Evolutionary AlgorithmsTobias Friedrich, Frank Neumann
Pageof 3