His research on Programming language often connects related areas such as Set (abstract data type) and Integer (computer science). His study in Programming language extends to Set (abstract data type) with its themes. With his scientific publications, his incorporates both Metaheuristic and Multi-swarm optimization. He carries out multidisciplinary research, doing studies in Multi-swarm optimization and Metaheuristic. His research ties Time complexity and Discrete mathematics together. His research on Time complexity often connects related areas such as Discrete mathematics. His research on Combinatorics frequently links to adjacent areas such as Longest common subsequence problem. His Longest common subsequence problem study frequently links to related topics such as Combinatorics. He integrates Artificial intelligence and Human–computer interaction in his studies.
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.
MITOS: Improved de novo metazoan mitochondrial genome annotation
Matthias Bernt;Alexander Donath;Frank Jühling;Frank Jühling;Fabian Externbrink.
Molecular Phylogenetics and Evolution (2013)
Ant colony optimization for resource-constrained project scheduling
D. Merkle;M. Middendorf;H. Schmeck.
IEEE Transactions on Evolutionary Computation (2002)
A hierarchical particle swarm optimizer and its adaptive variant
S. Janson;M. Middendorf.
systems man and cybernetics (2005)
Bi-Criterion Optimization with Multi Colony Ant Algorithms
Steffen Iredi;Daniel Merkle;Martin Middendorf.
international conference on evolutionary multi criterion optimization (2001)
Multi Colony Ant Algorithms
Martin Middendorf;Frank Reischle;Hartmut Schmeck.
Journal of Heuristics (2002)
A Population Based Approach for ACO
Michael Guntsch;Martin Middendorf.
Lecture Notes in Computer Science (2002)
Applying Population Based ACO to Dynamic Optimization Problems
Michael Guntsch;Martin Middendorf.
Lecture Notes in Computer Science (2002)
CREx: inferring genomic rearrangements based on common intervals.
Matthias Bernt;Daniel Merkle;Kai Ramsch;Guido Fritzsch.
Bioinformatics (2007)
Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP
Michael Guntsch;Martin Middendorf.
evoworkshops on applications of evolutionary computing (2001)
Guest editorial: special section on ant colony optimization
M. Dorigo;L.M. Gambardella;M. Middendorf;T. Stutzle.
IEEE Transactions on Evolutionary Computation (2002)
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:
Karlsruhe Institute of Technology
Leipzig University
University of Sydney
University of Illinois at Urbana-Champaign
Leipzig University
Spanish National Research Council
TU Wien
Université Libre de Bruxelles
Université Libre de Bruxelles
University of Warwick
Ghent University
Jönköping University
University of Padua
University of Paris-Saclay
Wuhan University of Technology
Universität Hamburg
University of Cagliari
University of Western Australia
Scripps Research Institute
University of British Columbia
University of Ferrara
University of Innsbruck
National Taiwan University
South African Medical Research Council
University of North Carolina at Chapel Hill
The University of Texas at Austin