default search action
Martin Middendorf
Person information
- affiliation: Leipzig University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j85]Lisa Fiedler, Matthias Bernt, Martin Middendorf, Peter F. Stadler:
Detecting gene breakpoints in noisy genome sequences using position-annotated colored de-Bruijn graphs. BMC Bioinform. 24(1): 235 (2023) - [c85]Daniel Werner, Fatma Turna, Hoang Thanh Le, Martin Middendorf:
XF-OPT/META: A Hyperparameter Optimization Framework Applied to the H -SPPBO Metaheuristic for the Dynamic TSP. SSCI 2023: 1183-1188 - 2022
- [j84]Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Complete edge-colored permutation graphs. Adv. Appl. Math. 139: 102377 (2022) - [j83]Philine Geser, Hoang Thanh Le, Tom Hartmann, Martin Middendorf:
On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine. Eur. J. Oper. Res. 303(2): 593-601 (2022) - [j82]Hoang Thanh Le, Martin Middendorf, Yuhui Shi:
An Improvement Heuristic Based on Variable Neighborhood Search for Dynamic Orienteering Problems with Changing Node Values and Changing Budgets. SN Comput. Sci. 3(4): 326 (2022) - [j81]Qi Zhao, Bai Yan, Yuhui Shi, Martin Middendorf:
Evolutionary Dynamic Multiobjective Optimization via Learning From Historical Search Process. IEEE Trans. Cybern. 52(7): 6119-6130 (2022) - 2021
- [j80]Hoang Thanh Le, Philine Geser, Martin Middendorf:
Iterated Local Search and Other Algorithms for Buffered Two-Machine Permutation Flow Shops with Constant Processing Times on One Machine. Evol. Comput. 29(3): 415-439 (2021) - [j79]Tom Hartmann, Max Bannach, Martin Middendorf:
Sorting Signed Permutations by Inverse Tandem Duplication Random Losses. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2177-2188 (2021) - [c84]Hoang Thanh Le, Martin Middendorf, Yuhui Shi:
An Improvement Heuristic Based on Variable Neighborhood Search for a Dynamic Orienteering Problem. EvoCOP 2021: 68-83 - [c83]Edward Kupfer, Hoang Thanh Le, Johanna Zitt, Ying-Chi Lin, Martin Middendorf:
A Hierarchical Simple Probabilistic Population-Based Algorithm Applied to the Dynamic TSP. SSCI 2021: 1-8 - 2020
- [j78]Yang Shen, Mingde Liu, Jian Yang, Yuhui Shi, Martin Middendorf:
A Hybrid Swarm Intelligence Algorithm for Vehicle Routing Problem With Time Windows. IEEE Access 8: 93882-93893 (2020) - [c82]Daniel Abitz, Tom Hartmann, Martin Middendorf:
A weighted population update rule for PACO applied to the single machine total weighted tardiness problem. GECCO 2020: 4-12 - [i4]Tom Hartmann, Max Bannach, Martin Middendorf, Peter F. Stadler, Nicolas Wieseke, Marc Hellmuth:
Complete Edge-Colored Permutation Graphs. CoRR abs/2004.07118 (2020) - [i3]Daniel Abitz, Tom Hartmann, Martin Middendorf:
A Weighted Population Update Rule for PACO Applied to the Single Machine Total Weighted Tardiness Problem. CoRR abs/2004.08433 (2020)
2010 – 2019
- 2019
- [j77]Tom Hartmann, Matthias Bernt, Martin Middendorf:
An Exact Algorithm for Sorting by Weighted Preserving Genome Rearrangements. IEEE ACM Trans. Comput. Biol. Bioinform. 16(1): 52-62 (2019) - [c81]Hoang Thanh Le, Philine Geser, Martin Middendorf:
An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine. EvoCOP 2019: 50-65 - 2018
- [j76]Tom Hartmann, Matthias Bernt, Martin Middendorf:
EqualTDRL: illustrating equivalent tandem duplication random loss rearrangements. BMC Bioinform. 19(1): 192:1-192:10 (2018) - [j75]Tom Hartmann, An-Chiang Chu, Martin Middendorf, Matthias Bernt:
Combinatorics of Tandem Duplication Random Loss Mutations on Circular Genomes. IEEE ACM Trans. Comput. Biol. Bioinform. 15(1): 83-95 (2018) - [j74]Tom Hartmann, Nicolas Wieseke, Roded Sharan, Martin Middendorf, Matthias Bernt:
Genome Rearrangement with ILP. IEEE ACM Trans. Comput. Biol. Bioinform. 15(5): 1585-1593 (2018) - 2017
- [e5]Yuhui Shi, Kay Chen Tan, Mengjie Zhang, Ke Tang, Xiaodong Li, Qingfu Zhang, Ying Tan, Martin Middendorf, Yaochu Jin:
Simulated Evolution and Learning - 11th International Conference, SEAL 2017, Shenzhen, China, November 10-13, 2017, Proceedings. Lecture Notes in Computer Science 10593, Springer 2017, ISBN 978-3-319-68758-2 [contents] - [i2]Marc Hellmuth, Nicolas Wieseke, Marcus Lechner, Hans-Peter Lenhof, Martin Middendorf, Peter F. Stadler:
Phylogenomics with Paralogs. CoRR abs/1712.06442 (2017) - 2016
- [j73]Yih-Chun Cheng, Tom Hartmann, Pei-Yun Tsai, Martin Middendorf:
Population based ant colony optimization for reconstructing ECG signals. Evol. Intell. 9(3): 55-66 (2016) - [j72]Martin Clauß, Lydia Lotzmann, Martin Middendorf:
A Population Based ACO Algorithm for the Combined Tours TSP Problem. EAI Endorsed Trans. Self Adapt. Syst. 2(7): e2 (2016) - [j71]Ying-Chi Lin, Martin Clauß, Martin Middendorf:
Simple Probabilistic Population-Based Optimization. IEEE Trans. Evol. Comput. 20(2): 245-262 (2016) - [c80]Ruby L. V. Moritz, Enrico Reich, Matthias Bernt, Martin Middendorf:
A Property Preserving Method for Extending a Single-Objective Problem Instance to Multiple Objectives with Specific Correlations. EvoCOP 2016: 18-33 - [c79]Yih-Chun Cheng, Tom Hartmann, Pei-Yun Tsai, Martin Middendorf:
Population Based Ant Colony Optimization for Reconstructing ECG Signals. EvoApplications (1) 2016: 770-785 - 2015
- [j70]Ruby L. V. Moritz, Enrico Reich, Maik Schwarz, Matthias Bernt, Martin Middendorf:
Refined ranking relations for selection of solutions in multi objective metaheuristics. Eur. J. Oper. Res. 243(2): 454-464 (2015) - [j69]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Task allocation in organic computing systems: networks with reconfigurable helper units. Int. J. Auton. Adapt. Commun. Syst. 8(1): 60-80 (2015) - [j68]Ruby L. V. Moritz, Martin Middendorf:
Decentralized and dynamic group formation of reconfigurable agents. Memetic Comput. 7(2): 77-91 (2015) - [j67]Nicolas Wieseke, Tom Hartmann, Matthias Bernt, Martin Middendorf:
Cophylogenetic Reconciliation with ILP. IEEE ACM Trans. Comput. Biol. Bioinform. 12(6): 1227-1235 (2015) - [c78]Martin Clauß, Lydia Lotzmann, Martin Middendorf:
A Population Based ACO Algorithm for the Combined Tours TSP Problem. BICT 2015: 128-135 - [c77]Ruby L. V. Moritz, Martin Middendorf:
Evolutionary Inheritance Mechanisms for Multi-criteriaDecision Making in Multi-agent Systems. GECCO 2015: 65-72 - [c76]Sebastian Volke, Dirk Zeckzer, Gerik Scheuermann, Martin Middendorf:
A Visual Method for Analysis and Comparison of Search Landscapes. GECCO 2015: 497-504 - 2014
- [j66]Manja Marz, Niko Beerenwinkel, Christian Drosten, Markus Fricke, Dmitrij Frishman, Ivo L. Hofacker, Dieter Hoffmann, Martin Middendorf, Thomas Rattei, Peter F. Stadler, Armin Töpfer:
Challenges in RNA virus bioinformatics. Bioinform. 30(13): 1793-1799 (2014) - [c75]Ruby L. V. Moritz, Enrico Reich, Matthias Bernt, Martin Middendorf:
The Influence of Correlated Objectives on Different Types of P-ACO Algorithms. EvoCOP 2014: 230-241 - [c74]Simon Bin, Sebastian Volke, Gerik Scheuermann, Martin Middendorf:
Comparing the Optimization Behaviour of Heuristics with Topology Based Visualization. TPNC 2014: 47-58 - 2013
- [j65]Sebastian Volke, Martin Middendorf, Mario Hlawitschka, Jens Kasten, Dirk Zeckzer, Gerik Scheuermann:
dPSO-Vis: Topology-based Visualization of Discrete Particle Swarm Optimization. Comput. Graph. Forum 32(3): 351-360 (2013) - [j64]Alexander Scheidler, Daniel Merkle, Martin Middendorf:
Swarm controlled emergence for ant clustering. Int. J. Intell. Comput. Cybern. 6(1): 62-82 (2013) - [c73]Matthias Bernt, Nicolas Wieseke, Martin Middendorf:
On Weighting Schemes for Gene Order Analysis. GCB 2013: 14-23 - [c72]Ruby L. V. Moritz, Enrico Reich, Maik Schwarz, Matthias Bernt, Martin Middendorf:
Refined ranking relations for multi objective optimization andapplication to P-ACO. GECCO 2013: 65-72 - [c71]Ruby L. V. Moritz, Martin Middendorf:
Self-adaptable Group Formation of Reconfigurable Agents in Dynamic Environments. NICSO 2013: 287-301 - [c70]Martin Clauß, Matthias Bernt, Martin Middendorf:
A common interval guided ACO algorithm for permutation problems. SIS 2013: 64-71 - [c69]Ruby L. V. Moritz, Martin Middendorf:
Self-organized cooperation between agents that have to solve resource collection tasks. SIS 2013: 206-212 - [c68]Ying-Chi Lin, Martin Middendorf:
Simple probabilistic population based optimization for combinatorial optimization. SIS 2013: 213-220 - [c67]Nicolas Wieseke, Matthias Bernt, Martin Middendorf:
Unifying Parsimonious Tree Reconciliation. WABI 2013: 200-214 - [e4]Martin Middendorf, Christian Blum:
Evolutionary Computation in Combinatorial Optimization - 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013. Proceedings. Lecture Notes in Computer Science 7832, Springer 2013, ISBN 978-3-642-37197-4 [contents] - 2012
- [c66]Ruby L. V. Moritz, Matthias Bernt, Martin Middendorf:
Annotation guided local similarity search in multiple sequences and its application to mitochondrial genomes. BIBE 2012: 157-162 - [c65]Matthias Bernt, Kun-Mao Chao, Jyun-Wei Kao, Martin Middendorf, Eric Tannier:
Preserving Inversion Phylogeny Reconstruction. WABI 2012: 1-13 - [e3]Jin-Kao Hao, Martin Middendorf:
Evolutionary Computation in Combinatorial Optimization - 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings. Lecture Notes in Computer Science 7245, Springer 2012, ISBN 978-3-642-29123-4 [contents] - 2011
- [j63]Matthias Bernt, Martin Middendorf:
A method for computing an inventory of metazoan mitochondrial gene order rearrangements. BMC Bioinform. 12(S-9): S6 (2011) - [j62]Alexander Scheidler, Martin Middendorf:
Learning classifier systems to evolve classification rules for systems of memory constrained components. Evol. Intell. 4(3): 127-143 (2011) - [j61]Michael Geis, Martin Middendorf:
Particle swarm optimization for finding RNA secondary structures. Int. J. Intell. Comput. Cybern. 4(2): 160-186 (2011) - [j60]Matthias Bernt, Kuan-Yu Chen, Ming-Chiang Chen, An-Chiang Chu, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf:
Finding all sorting tandem duplication random loss operations. J. Discrete Algorithms 9(1): 32-48 (2011) - [j59]Konrad Diwold, Andrej Aderhold, Alexander Scheidler, Martin Middendorf:
Performance evaluation of artificial bee colony optimization and new selection schemes. Memetic Comput. 3(3): 149-162 (2011) - [j58]Konrad Diwold, Timothy M. Schaerf, Mary R. Myerscough, Martin Middendorf, Madeleine Beekman:
Deciding on the wing: in-flight decision making and search space sampling in the red dwarf honeybee Apis florea. Swarm Intell. 5(2): 121-141 (2011) - [c64]Wei Cheng, Bernd Scheuermann, Martin Middendorf:
Quick-ACO: Accelerating Ant Decisions and Pheromone Updates in ACO. EvoCOP 2011: 238-249 - [c63]Konrad Diwold, Daniel Himmelbach, René Meier, Carsten Baldauf, Martin Middendorf:
Bonding as a swarm: applying bee nest-site selection behaviour to protein docking. GECCO 2011: 93-100 - [c62]Ruby L. V. Moritz, Kai Ramsch, Martin Middendorf:
Trophallaxis-inspired self-organized task exchange in heterogeneous swarms. SWIS 2011: 221-228 - [p4]Alexander Scheidler, Arne Brutschy, Konrad Diwold, Daniel Merkle, Martin Middendorf:
Ant Inspired Methods for Organic Computing. Organic Computing 2011: 95-109 - 2010
- [j57]Daniel Merkle, Martin Middendorf, Nicolas Wieseke:
A parameter-adaptive dynamic programming approach for inferring cophylogenies. BMC Bioinform. 11(S-1): 60 (2010) - [j56]Sebastian Lange, Martin Middendorf:
Multi-level reconfigurable architectures in the switch model. J. Syst. Archit. 56(2-3): 103-115 (2010) - [c61]Konrad Diwold, Madeleine Beekman, Martin Middendorf:
Bee Nest Site Selection as an Optimization Process. ALIFE 2010: 626-633 - [c60]Konrad Diwold, Thomas Ruhnke, Martin Middendorf:
Sensor Placement in Water Networks Using a Population-Based Ant Colony Optimization Algorithm. ICCCI (3) 2010: 426-437 - [c59]Andrej Aderhold, Konrad Diwold, Alexander Scheidler, Martin Middendorf:
Artificial Bee Colony Optimization: A New Selection Scheme and Its Performance. NICSO 2010: 283-294 - [p3]Sebastian Lange, Martin Middendorf:
Models and Algorithms for Hyperreconfigurable Hardware. Dynamically Reconfigurable Systems 2010: 75-94
2000 – 2009
- 2009
- [j55]Konrad Diwold, Daniel Merkle, Martin Middendorf:
Adapting to Dynamic Environments: Polyethism in Response Threshold Models for Social Insects. Adv. Complex Syst. 12(3): 327-346 (2009) - [j54]Marc Hellmuth, Daniel Merkle, Martin Middendorf:
Extended shapes for the combinatorial design of RNA sequences. Int. J. Comput. Biol. Drug Des. 2(4): 371-384 (2009) - [j53]Andries P. Engelbrecht, Xiaodong Li, Martin Middendorf, Luca Maria Gambardella:
Editorial Special Issue: Swarm Intelligence. IEEE Trans. Evol. Comput. 13(4): 677-680 (2009) - [c58]Matthias Bernt, Ming-Chiang Chen, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf:
Finding All Sorting Tandem Duplication Random Loss Operations. CPM 2009: 301-313 - [c57]Alexander Scheidler, Martin Middendorf:
Evolved cooperation and emergent communication structures in learning classifier based organic computing systems. GECCO (Companion) 2009: 2633-2640 - [c56]Marc Hellmuth, Daniel Merkle, Martin Middendorf:
On the Design of RNA Sequences for Realizing Extended Shapes. IJCBS 2009: 167-173 - [c55]Hugo Hernández, Christian Blum, Martin Middendorf, Kai Ramsch, Alexander Scheidler:
Self-synchronized duty-cycling for mobile sensor networks with energy harvesting capabilities: A swarm intelligence study. SIS 2009: 153-159 - [i1]Jörg Fliege, Nicola Beume, Jürgen Branke, Heinrich Braun, Nirupam Chakraborti, Kalyanmoy Deb, Sabine Helwig, Joshua D. Knowles, Martin Middendorf, Sanaz Mostaghim, Silvia Poles, Daniel E. Salazar Aponte, Shukla Pradymn, El-Ghazali Talbi:
09041 Working Group on EMO for Robust Multiobjective Optimization (1st Round). Hybrid and Robust Approaches to Multiobjective Optimization 2009 - 2008
- [j52]Stefan Janson, Daniel Merkle, Martin Middendorf:
Molecular docking with multi-objective Particle Swarm Optimization. Appl. Soft Comput. 8(1): 666-675 (2008) - [j51]Stefan Janson, Daniel Merkle, Martin Middendorf:
A decentralization approach for swarm intelligence algorithms in networks applied to multi swarm PSO. Int. J. Intell. Comput. Cybern. 1(1): 25-45 (2008) - [j50]Michael Geis, Martin Middendorf:
Creating melodies and baroque harmonies with ant colony optimization. Int. J. Intell. Comput. Cybern. 1(2): 213-238 (2008) - [j49]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Self-Organized Task Allocation for Service Tasks in Computing Systems with Reconfigurable Components. J. Math. Model. Algorithms 7(2): 237-254 (2008) - [j48]Daniel Merkle, Martin Middendorf:
Swarm intelligence and signal processing [DSP Exploratory]. IEEE Signal Process. Mag. 25(6): 152-158 (2008) - [j47]Matthias Bernt, Daniel Merkle, Martin Middendorf:
Solving the Preserving Reversal Median Problem. IEEE ACM Trans. Comput. Biol. Bioinform. 5(3): 332-347 (2008) - [j46]Jürgen Jost, Dirk Helbing, András Lörincz, Martin Middendorf:
Editorial. Theory Biosci. 127(2): 67-68 (2008) - [j45]Alexander Scheidler, Daniel Merkle, Martin Middendorf:
Stability and performance of ant queue inspired task partitioning methods. Theory Biosci. 127(2): 149-161 (2008) - [j44]Sebastian Lange, Martin Middendorf:
Design Aspects of Multi-level Reconfigurable Architectures. J. Signal Process. Syst. 51(1): 23-37 (2008) - [c54]Arne Brutschy, Alexander Scheidler, Daniel Merkle, Martin Middendorf:
Learning from House-Hunting Ants: Collective Decision-Making in Organic Computing Systems. ANTS Conference 2008: 96-107 - [c53]Alexander Scheidler, Christian Blum, Daniel Merkle, Martin Middendorf:
Emergent Sorting in Networks of Router Agents. ANTS Conference 2008: 299-306 - [c52]Tri Basuki Kurniawan, Noor Khafifah Khalid, Zuwairie Ibrahim, Marzuki Khalid, Martin Middendorf:
Evaluation of Ordering Methods for DNA Sequence Design Based on Ant Colony System. Asia International Conference on Modelling and Simulation 2008: 905-910 - [c51]Sebastian Lange, Martin Middendorf:
Hyperreconfigurable architectures. FPL 2008: 353 - [c50]Alexander Scheidler, Daniel Merkle, Martin Middendorf:
Congestion Control in Ant Like Moving Agent Systems. BICC 2008: 33-43 - [c49]Matthias Bernt, Daniel Merkle, Martin Middendorf:
An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree. RECOMB-CG 2008: 143-157 - [p2]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Self-adaptive Worker-Helper Systems with Self-Organized Task Allocation. Organic Computing 2008: 221-239 - [p1]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Organic Computing and Swarm Intelligence. Swarm Intelligence 2008: 253-281 - 2007
- [j43]Matthias Bernt, Daniel Merkle, Martin Middendorf:
Using median sets for inferring phylogenetic trees. Bioinform. 23(2): 129-135 (2007) - [j42]Matthias Bernt, Daniel Merkle, Kai Ramsch, Guido Fritzsch, Marleen Perseke, Detlef Bernhard, Martin Schlegel, Peter F. Stadler, Martin Middendorf:
CREx: inferring genomic rearrangements based on common intervals. Bioinform. 23(21): 2957-2958 (2007) - [j41]Bernd Scheuermann, Stefan Janson, Martin Middendorf:
Hardware-oriented ant colony optimization. J. Syst. Archit. 53(7): 386-402 (2007) - [c48]Michael Geis, Martin Middendorf:
An ant colony optimizer for melody creation with baroque harmony. IEEE Congress on Evolutionary Computation 2007: 461-468 - [c47]Matthias Bernt, Daniel Merkle, Martin Middendorf:
A Fast and Exact Algorithm for the Perfect Reversal Median Problem. ISBRA 2007: 305-316 - [c46]Michael Geis, Martin Middendorf:
A Particle Swarm Optimizer for Finding Minimum Free Energy RNA Secondary Structures. SIS 2007: 1-8 - [c45]Stefan Janson, Martin Middendorf:
On Trajectories of Particles in PSO. SIS 2007: 150-155 - [c44]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Swarm Controlled Emergence - Designing an Anti-Clustering Ant System. SIS 2007: 242-249 - 2006
- [j40]Daniel Merkle, Martin Middendorf:
Marco Dorigo and Thomas Stützle, Ant Colony Optimization, MIT Press (2004) ISBN 0-262-04219-3. Eur. J. Oper. Res. 168(1): 269-271 (2006) - [j39]Stefan Janson, Martin Middendorf:
A hierarchical particle swarm optimizer for noisy and dynamic environments. Genet. Program. Evolvable Mach. 7(4): 329-354 (2006) - [j38]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Modeling Ant Brood ending Patterns with Cellular Automata. J. Cell. Autom. 1(2): 183-194 (2006) - [j37]Matthias Bernt, Daniel Merkle, Martin Middendorf:
Genome Rearrangement Based on Reversals that Preserve Conserved Intervals. IEEE ACM Trans. Comput. Biol. Bioinform. 3(3): 275-288 (2006) - [c43]Matthias Bernt, Daniel Merkle, Martin Middendorf:
The Reversal Median Problem, Common Intervals, and Mitochondrial Gene Orders. CompLife 2006: 52-63 - [c42]Sebastian Lange, Martin Middendorf:
Cache Architectures for Reconfigurable Hardware. ERSA 2006: 77-83 - [c41]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Using Decentralized Clustering for Task Allocation in Networks with Reconfigurable Helper Units. IWSOS/EuroNGI 2006: 137-147 - [c40]Stefan Janson, Enrique Alba, Bernabé Dorronsoro, Martin Middendorf:
Hierarchical Cellular Genetic Algorithm. EvoCOP 2006: 111-122 - [c39]Sebastian Lange, Martin Middendorf:
Granularity aspects for the design of multi-level reconfigurable architectures. FPT 2006: 9-16 - [c38]Sebastian Lange, Martin Middendorf:
Multi-level reconfigurable architectures in the switch model. IPDPS 2006 - [c37]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Self-organized task allocation for computing systems with reconfigurable components. IPDPS 2006 - 2005
- [j36]Sebastian Lange, Martin Middendorf:
Multi task hyperreconfigurable architectures: models and reconfiguration problems. Int. J. Embed. Syst. 1(3/4): 154-164 (2005) - [j35]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Decentralized packet clustering in router-based networks. Int. J. Found. Comput. Sci. 16(2): 321-341 (2005) - [j34]Daniel Merkle, Martin Middendorf:
On solving permutation scheduling problems with ant colony optimization. Int. J. Syst. Sci. 36(5): 255-266 (2005) - [j33]Sebastian Lange, Martin Middendorf:
Hyperreconfigurable architectures and the partition into hypercontexts problem. J. Parallel Distributed Comput. 65(6): 743-754 (2005) - [j32]Daniel Merkle, Martin Middendorf:
Reconstruction of the cophylogenetic history of related phylogenetic trees with divergence timing information. Theory Biosci. 123(4): 277-299 (2005) - [j31]Jürgen Branke, Martin Middendorf, Guntram Noeth, Maged M. Dessouky:
Waiting Strategies for Dynamic Vehicle Routing. Transp. Sci. 39(3): 298-312 (2005) - [j30]Stefan Janson, Martin Middendorf:
A hierarchical particle swarm optimizer and its adaptive variant. IEEE Trans. Syst. Man Cybern. Part B 35(6): 1272-1282 (2005) - [c36]Bernd Scheuermann, Martin Middendorf:
Counter-Based Ant Colony Optimization as a Hardware-Oriented Meta-heuristic. EvoWorkshops 2005: 235-244 - [c35]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Dynamic Decentralized Packet Clustering in Networks. EvoWorkshops 2005: 574-583 - [c34]Sebastian Lange, Martin Middendorf:
Heuristics for Context-Caches in 2-Level Reconfigurable Architectures. FPT 2005: 293-294 - [c33]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Modelling Ant Brood Tending Behavior with Cellular Automata. International Conference on Computational Science (2) 2005: 412-419 - [c32]Stefan Janson, Martin Middendorf:
Flexible Particle Swarm Optimization Tasks for Reconfigurable Processor Arrays. IPDPS 2005 - [c31]Matthias Bernt, Daniel Merkle, Martin Middendorf:
A Parallel Algorithm for Solving the Reversal Median Problem. PPAM 2005: 1089-1096 - [c30]Sebastian Lange, Martin Middendorf:
On the design of two-level reconfigurable architectures. ReConFig 2005 - 2004
- [j29]Daniel Merkle, Martin Middendorf:
Dynamic Polyethism and Competition for Tasks in Threshold Reinforcement Models of Social Insects. Adapt. Behav. 12(3-4): 251-262 (2004) - [j28]Bernd Scheuermann, Keith So, Michael Guntsch, Martin Middendorf, Oliver Diessel, Hossam A. ElGindy, Hartmut Schmeck:
FPGA implementation of population-based ant colony optimization. Appl. Soft Comput. 4(3): 303-322 (2004) - [j27]Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl, Colin Reeves:
Editorial. J. Math. Model. Algorithms 3(4): 311-312 (2004) - [j26]Martin Middendorf, David F. Manlove:
Combined super-/substring and super-/subsequence problems. Theor. Comput. Sci. 320(2-3): 247-267 (2004) - [c29]Daniel Merkle, Martin Middendorf:
Competition Controlled Pheromone Update for Ant Colony Optimization. ANTS Workshop 2004: 95-105 - [c28]Bernd Scheuermann, Michael Guntsch, Martin Middendorf, Hartmut Schmeck:
Time-Scattered Heuristic for the Hardware Implementation of Population-Based ACO. ANTS Workshop 2004: 250-261 - [c27]Sebastian Lange, Martin Middendorf:
Hyperreconfigurable Architectures as Flexible Control Systems. ARCS Workshops 2004: 175-184 - [c26]Stefan Janson, Martin Middendorf:
A Hierarchical Particle Swarm Optimizer for Dynamic Optimization Problems. EvoWorkshops 2004: 513-524 - [c25]Sebastian Lange, Martin Middendorf:
Hyperreconfigurable Architectures for Fast Run Time Reconfiguration. FCCM 2004: 304-305 - [c24]Sebastian Lange, Martin Middendorf:
The Partition into Hypercontexts Problem for Hyperreconfigurable Architectures. FPL 2004: 251-260 - [c23]Sebastian Lange, Martin Middendorf:
Models and Reconfiguration Problems for Multi Task Hyperreconfigurable Architectures. IPDPS 2004 - [c22]Daniel Merkle, Martin Middendorf, Alexander Scheidler:
Decentralized Packet Clustering in Networks. IPDPS 2004 - 2003
- [j25]Daniel Merkle, Martin Middendorf:
Ant Colony Optimization with Global Pheromone Evaluation for Scheduling a Single Machine. Appl. Intell. 18(1): 105-111 (2003) - [j24]Stefan Janson, Daniel Merkle, Martin Middendorf, Hossam A. ElGindy, Hartmut Schmeck:
On Enforced Convergence of ACO and its Implementation on the Reconfigurable Mesh Architecture Using Size Reduction Tasks. J. Supercomput. 26(3): 221-238 (2003) - [c21]Stefan Janson, Martin Middendorf:
A hierarchical particle swarm optimizer. IEEE Congress on Evolutionary Computation 2003: 770-776 - [c20]Michael Guntsch, Martin Middendorf:
Solving Multi-criteria Optimization Problems with Population-Based ACO. EMO 2003: 464-478 - [e2]Günther R. Raidl, Jean-Arcady Meyer, Martin Middendorf, Stefano Cagnoni, Juan J. Romero Cardalda, David Corne, Jens Gottlieb, Agnès Guillot, Emma Hart, Colin G. Johnson, Elena Marchiori:
Applications of Evolutionary Computing, EvoWorkshop 2003: EvoBIO, EvoCOP, EvoIASP, EvoMUSART, EvoROB, and EvoSTIM, Essex, UK, April 14-16, 2003, Proceedings. Lecture Notes in Computer Science 2611, Springer 2003, ISBN 3-540-00976-0 [contents] - 2002
- [j23]Daniel Merkle, Martin Middendorf:
Modeling the Dynamics of Ant Colony Optimization. Evol. Comput. 10(3): 235-262 (2002) - [j22]Daniel Merkle, Martin Middendorf:
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays. Genet. Program. Evolvable Mach. 3(4): 345-361 (2002) - [j21]Martin Middendorf, Frank Reischle, Hartmut Schmeck:
Multi Colony Ant Algorithms. J. Heuristics 8(3): 305-320 (2002) - [j20]Jürgen Branke, Stefan Leppert, Martin Middendorf, Peter Eades:
Width-restricted layering of acyclic digraphs with consideration of dummy nodes. Inf. Process. Lett. 81(2): 59-63 (2002) - [j19]Martin Middendorf, Bernd Scheuermann, Hartmut Schmeck, Hossam A. ElGindy:
An Evolutionary Approach to Dynamic Task Scheduling on FPGAs with Restricted Buffer. J. Parallel Distributed Comput. 62(9): 1407-1420 (2002) - [j18]Luca Maria Gambardella, Marco Dorigo, Martin Middendorf, Thomas Stützle:
Guest editorial: special section on ant colony optimization. IEEE Trans. Evol. Comput. 6(4): 317-319 (2002) - [j17]Daniel Merkle, Martin Middendorf, Hartmut Schmeck:
Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evol. Comput. 6(4): 333-346 (2002) - [c19]Michael Guntsch, Martin Middendorf:
Applying Population Based ACO to Dynamic Optimization Problems. Ant Algorithms 2002: 111-122 - [c18]Daniel Merkle, Martin Middendorf:
Modelling ACO: Composed Permutation Problems. Ant Algorithms 2002: 149-162 - [c17]Michael Guntsch, Martin Middendorf:
A Population Based Approach for ACO. EvoWorkshops 2002: 72-81 - [c16]Daniel Merkle, Martin Middendorf:
Ant Colony Optimization with the Relative Pheromone Evaluation Method. EvoWorkshops 2002: 325-333 - [c15]Michael Guntsch, Martin Middendorf, Bernd Scheuermann, Oliver Diessel, Hossam A. ElGindy, Hartmut Schmeck, Keith So:
Population based ant colony optimization on FPGA. FPT 2002: 125-132 - [c14]Daniel Merkle, Martin Middendorf:
Studies On The Dynamics Of Ant Colony Optimization Algorithms. GECCO 2002: 105-112 - [e1]Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl:
Applications of Evolutionary Computing, EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, April 3-4, 2002, Proceedings. Lecture Notes in Computer Science 2279, Springer 2002, ISBN 3-540-43432-1 [contents] - 2001
- [c13]Steffen Iredi, Daniel Merkle, Martin Middendorf:
Bi-Criterion Optimization with Multi Colony Ant Algorithms. EMO 2001: 359-372 - [c12]Michael Guntsch, Martin Middendorf:
Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP. EvoWorkshops 2001: 213-222 - [c11]Daniel Merkle, Martin Middendorf:
A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization. EvoWorkshops 2001: 484-494 - [c10]Daniel Merkle, Martin Middendorf:
Fast ant colony optimization on reconfigurable processor arrays. IPDPS 2001: 144 - 2000
- [c9]Daniel Merkle, Martin Middendorf:
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems. EvoWorkshops 2000: 287-296 - [c8]Hossam A. ElGindy, Martin Middendorf, Hartmut Schmeck, Bernd Schmidt:
Task Rearrangement on Partially Reconfigurable FPGAs with Restricted Buffer. FPL 2000: 379-388 - [c7]Daniel Merkle, Martin Middendorf, Hartmut Schmeck:
Ant Colony Optimization for Resource-Constrained Projet Scheduling. GECCO 2000: 893- - [c6]Martin Middendorf, Frank Reischle, Hartmut Schmeck:
Information Exchange in Multi Colony Ant Algorithms. IPDPS Workshops 2000: 645-652
1990 – 1999
- 1999
- [j16]Martin Middendorf, Vadim G. Timkovsky:
Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems. J. Comb. Optim. 3(4): 417-435 (1999) - [j15]Martin Middendorf, Welf Löwe, Wolf Zimmermann:
Scheduling Inverse Trees Under the Communication Model of the LogP-Machine. Theor. Comput. Sci. 215(1-2): 137-168 (1999) - [j14]Martin Middendorf, Hartmut Schmeck, Heiko Schröder, Gavin Turner:
Multiplication of Matrices With Different Sparseness Properties on Dynamically Reconfigurable Meshes. VLSI Design 9(1): 69-81 (1999) - [c5]Martin Middendorf:
Bit Summation on the Reconfigurable Mesh. IPPS/SPDP Workshops 1999: 625-633 - 1998
- [j13]Martin Middendorf, Hossam A. ElGindy:
Matrix Multiplication on Processor Arrays with Optical Buses. Informatica (Slovenia) 22(3) (1998) - [j12]Martin Middendorf:
Shortest Common Superstrings and Scheduling with Coordinated Starting Times. Theor. Comput. Sci. 191(1-2): 205-214 (1998) - [c4]Wolf Zimmermann, Martin Middendorf, Welf Löwe:
On Optimal k-linear Scheduling of Tree-Like Graphs for LogP-Machines. Euro-Par 1998: 328-336 - [c3]Carsten Steckel, Martin Middendorf, Hossam A. ElGindy, Hartmut Schmeck:
A Simulator for the Reconfigurable Mesh Architecture. IPPS/SPDP Workshops 1998: 99-104 - [c2]René Michel, Martin Middendorf:
An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem. PPSN 1998: 692-701 - 1996
- [j11]Martin Middendorf:
Manhattan Channel Routing is NP-complete Under Truly Restricted Settings. Chic. J. Theor. Comput. Sci. 1996 (1996) - [j10]Jonathan E. Atkins, Martin Middendorf:
On Physical Mapping and the Consecutive Ones Property for Sparse Matrices. Discret. Appl. Math. 71(1-3): 23-40 (1996) - [j9]Campbell Fraser, Robert W. Irving, Martin Middendorf:
Maximal Common Subsequences and Minimal Common Supersequences. Inf. Comput. 124(2): 145-153 (1996) - [j8]Martin Middendorf:
Two-Dimensional Partitioning Problems. Theor. Comput. Sci. 164(1&2): 73-106 (1996) - 1995
- [j7]Martin Middendorf, Hartmut Schmeck, G. Turner:
Sparse Matrix Multiplication on a Reconfigurable Mesh. Aust. Comput. J. 27(2): 37-40 (1995) - [j6]Martin Middendorf:
On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet. Theor. Comput. Sci. 145(1&2): 317-327 (1995) - 1994
- [j5]Martin Middendorf:
More on the Complexity of Common Superstring and Supersequence Problems. Theor. Comput. Sci. 125(2): 205-228 (1994) - [c1]Martin Middendorf:
On the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences. ISAAC 1994: 306-314 - 1993
- [j4]Martin Middendorf:
Minimum Broadcast Time is NP-Complete for 3-Regular Planar Graphs and Deadline 2. Inf. Process. Lett. 46(6): 281-287 (1993) - [j3]Hartmut Schmeck, Heiko Schröder, Jørgen Staunstrup, Martin Middendorf:
Problem Heaps and Their Evaluation. Parallel Process. Lett. 3: 147-155 (1993) - [j2]Martin Middendorf:
The Shortest Common Nonsubsequence Problem is NP-Complete. Theor. Comput. Sci. 108(2): 365-369 (1993) - 1992
- [b1]Martin Middendorf:
Zur Komplexität von Einbettungsproblemen für Wortmengen. University of Hanover, Hannover, Germany, 1992, pp. 1-150 - [j1]Jürgen Duske, Martin Middendorf, Rainer Parchmann:
Indexed counter languages. RAIRO Theor. Informatics Appl. 26: 93-113 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-23 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint