Dirk Sudholt focuses on Evolutionary algorithm, Mutation, Mathematical optimization, Function and Algorithm. Dirk Sudholt combines subjects such as Evolutionary computation, Local search, Metaheuristic and Combinatorics with his study of Evolutionary algorithm. His studies in Mutation integrate themes in fields like Theoretical computer science, Mutation rate and Crossover.
His Mutation rate research is multidisciplinary, relying on both Local optimum, Artificial intelligence and Premature convergence. His work on Ant colony optimization algorithms is typically connected to Bounded function as part of general Mathematical optimization study, connecting several disciplines of science. His research integrates issues of Contrast and Heuristics in his study of Algorithm.
His scientific interests lie mostly in Evolutionary algorithm, Mathematical optimization, Algorithm, Function and Mutation. His study in Evolutionary algorithm is interdisciplinary in nature, drawing from both Evolutionary computation, Genetic algorithm, Theoretical computer science and Heuristics. His Mathematical optimization research includes themes of Time complexity and Artificial intelligence.
Dirk Sudholt interconnects Statistical hypothesis testing, Robustness and Benchmark in the investigation of issues within Algorithm. His Mutation study combines topics in areas such as Variation, Selection, Mutation rate and Crossover. His Ant colony optimization algorithms research is multidisciplinary, incorporating perspectives in Shortest path problem and Metaheuristic.
Evolutionary algorithm, Function, Mathematical optimization, Local search and Heuristics are his primary areas of study. His work carried out in the field of Evolutionary algorithm brings together such families of science as Local optimum, Crossover, Discrete mathematics and Mutation. His Crossover study integrates concerns from other disciplines, such as Multi-objective optimization and Premature convergence.
His Tournament selection and Memetic algorithm study in the realm of Mathematical optimization connects with subjects such as Crowding. His Local search study is focused on Algorithm in general. His research on Heuristics also deals with topics like
Dirk Sudholt mostly deals with Evolutionary algorithm, Function, Time complexity, Mutation and Diversity. His Evolutionary algorithm study deals with the bigger picture of Mathematical optimization. His studies examine the connections between Time complexity and genetics, as well as such issues in Binary logarithm, with regards to Robustness and Hill climbing.
As part of the same scientific family, Dirk Sudholt usually focuses on Mutation, concentrating on Crossover and intersecting with Premature convergence and Mutation rate. The various areas that he examines in his Combinatorics study include Probability distribution, Ant colony optimization algorithms, Global optimization and Metaheuristic. His Algorithm research is multidisciplinary, incorporating elements of Expected value and Simple random sample.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
D. Sudholt.
IEEE Transactions on Evolutionary Computation (2013)
A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms
D. Sudholt.
IEEE Transactions on Evolutionary Computation (2013)
Crossover is provably essential for the Ising model on trees
Dirk Sudholt.
genetic and evolutionary computation conference (2005)
Crossover is provably essential for the Ising model on trees
Dirk Sudholt.
genetic and evolutionary computation conference (2005)
Analysis of diversity-preserving mechanisms for global exploration*
Tobias Friedrich;Pietro S. Oliveto;Dirk Sudholt;Carsten Witt.
Evolutionary Computation (2009)
Analysis of diversity-preserving mechanisms for global exploration*
Tobias Friedrich;Pietro S. Oliveto;Dirk Sudholt;Carsten Witt.
Evolutionary Computation (2009)
Escaping Local Optima Using Crossover With Emergent Diversity
Duc-Cuong Dang;Tobias Friedrich;Timo Kotzing;Martin S. Krejca.
IEEE Transactions on Evolutionary Computation (2018)
Escaping Local Optima Using Crossover With Emergent Diversity
Duc-Cuong Dang;Tobias Friedrich;Timo Kotzing;Martin S. Krejca.
IEEE Transactions on Evolutionary Computation (2018)
The choice of the offspring population size in the (1,λ) evolutionary algorithm
Jonathan E. Rowe;Dirk Sudholt.
Theoretical Computer Science (2014)
The choice of the offspring population size in the (1,λ) evolutionary algorithm
Jonathan E. Rowe;Dirk Sudholt.
Theoretical Computer Science (2014)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
Technical University of Denmark
University of Adelaide
Aberystwyth University
École Polytechnique
Hasso Plattner Institute
University of York
Leiden University
Southern University of Science and Technology
University of Malaga
University of Sheffield
York University
University of Regina
Shanghai Jiao Tong University
Purdue University West Lafayette
University of Upper Alsace
Demokritos National Centre for Scientific Research
University of California, Merced
Colorado State University
Peking University
Genentech
University of Washington
University of Oslo
Université Paris Cité
University of Gothenburg
University of Minnesota
University of Oxford