| * | 2009 |
|---|
| 93 | EE | 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 |
| 92 | EE | Alexander Scheidler,
Martin Middendorf:
Evolved cooperation and emergent communication structures in learning classifier based organic computing systems.
GECCO (Companion) 2009: 2633-2640 |
| 2008 |
|---|
| 91 | EE | Alexander Scheidler,
Christian Blum,
Daniel Merkle,
Martin Middendorf:
Emergent Sorting in Networks of Router Agents.
ANTS Conference 2008: 299-306 |
| 90 | EE | 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 |
| 89 | EE | 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 |
| 88 | EE | Sebastian Lange,
Martin Middendorf:
Hyperreconfigurable architectures.
FPL 2008: 353 |
| 87 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree.
RECOMB-CG 2008: 143-157 |
| 86 | EE | Daniel Merkle,
Martin Middendorf,
Alexander Scheidler:
Organic Computing and Swarm Intelligence.
Swarm Intelligence 2008: 253-281 |
| 85 | EE | Stefan Janson,
Daniel Merkle,
Martin Middendorf:
Molecular docking with multi-objective Particle Swarm Optimization.
Appl. Soft Comput. 8(1): 666-675 (2008) |
| 84 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
Solving the Preserving Reversal Median Problem.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(3): 332-347 (2008) |
| 83 | EE | Sebastian Lange,
Martin Middendorf:
Design Aspects of Multi-level Reconfigurable Architectures.
Signal Processing Systems 51(1): 23-37 (2008) |
| 2007 |
|---|
| 82 | EE | Michael Geis,
Martin Middendorf:
An ant colony optimizer for melody creation with baroque harmony.
IEEE Congress on Evolutionary Computation 2007: 461-468 |
| 81 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
A Fast and Exact Algorithm for the Perfect Reversal Median Problem.
ISBRA 2007: 305-316 |
| 80 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
Using median sets for inferring phylogenetic trees.
Bioinformatics 23(2): 129-135 (2007) |
| 79 | EE | 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.
Bioinformatics 23(21): 2957-2958 (2007) |
| 78 | EE | Bernd Scheuermann,
Stefan Janson,
Martin Middendorf:
Hardware-oriented ant colony optimization.
Journal of Systems Architecture 53(7): 386-402 (2007) |
| 2006 |
|---|
| 77 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
The Reversal Median Problem, Common Intervals, and Mitochondrial Gene Orders.
CompLife 2006: 52-63 |
| 76 | | Sebastian Lange,
Martin Middendorf:
Cache Architectures for Reconfigurable Hardware.
ERSA 2006: 77-83 |
| 75 | EE | Stefan Janson,
Enrique Alba,
Bernabé Dorronsoro,
Martin Middendorf:
Hierarchical Cellular Genetic Algorithm.
EvoCOP 2006: 111-122 |
| 74 | EE | Sebastian Lange,
Martin Middendorf:
Multi-level reconfigurable architectures in the switch model.
IPDPS 2006 |
| 73 | EE | Daniel Merkle,
Martin Middendorf,
Alexander Scheidler:
Self-organized task allocation for computing systems with reconfigurable components.
IPDPS 2006 |
| 72 | EE | Daniel Merkle,
Martin Middendorf,
Alexander Scheidler:
Using Decentralized Clustering for Task Allocation in Networks with Reconfigurable Helper Units.
IWSOS/EuroNGI 2006: 137-147 |
| 71 | EE | Daniel Merkle,
Martin Middendorf:
Marco Dorigo and Thomas Stützle, Ant Colony Optimization, MIT Press (2004) ISBN 0-262-04219-3.
European Journal of Operational Research 168(1): 269-271 (2006) |
| 70 | EE | Stefan Janson,
Martin Middendorf:
A hierarchical particle swarm optimizer for noisy and dynamic environments.
Genetic Programming and Evolvable Machines 7(4): 329-354 (2006) |
| 69 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
Genome Rearrangement Based on Reversals that Preserve Conserved Intervals.
IEEE/ACM Trans. Comput. Biology Bioinform. 3(3): 275-288 (2006) |
| 2005 |
|---|
| 68 | EE | Bernd Scheuermann,
Martin Middendorf:
Counter-Based Ant Colony Optimization as a Hardware-Oriented Meta-heuristic.
EvoWorkshops 2005: 235-244 |
| 67 | EE | Daniel Merkle,
Martin Middendorf,
Alexander Scheidler:
Dynamic Decentralized Packet Clustering in Networks.
EvoWorkshops 2005: 574-583 |
| 66 | | Sebastian Lange,
Martin Middendorf:
Heuristics for Context-Caches in 2-Level Reconfigurable Architectures.
FPT 2005: 293-294 |
| 65 | EE | Stefan Janson,
Martin Middendorf:
Flexible Particle Swarm Optimization Tasks for Reconfigurable Processor Arrays.
IPDPS 2005 |
| 64 | EE | Daniel Merkle,
Martin Middendorf,
Alexander Scheidler:
Modelling Ant Brood Tending Behavior with Cellular Automata.
International Conference on Computational Science (2) 2005: 412-419 |
| 63 | EE | Matthias Bernt,
Daniel Merkle,
Martin Middendorf:
A Parallel Algorithm for Solving the Reversal Median Problem.
PPAM 2005: 1089-1096 |
| 62 | EE | Stefan Janson,
Martin Middendorf:
A hierarchical particle swarm optimizer and its adaptive variant.
IEEE Transactions on Systems, Man, and Cybernetics, Part B 35(6): 1272-1282 (2005) |
| 61 | EE | Sebastian Lange,
Martin Middendorf:
Multi task hyperreconfigurable architectures: models and reconfiguration problems.
IJES 1(3/4): 154-164 (2005) |
| 60 | EE | Daniel Merkle,
Martin Middendorf,
Alexander Scheidler:
Decentralized packet clustering in router-based networks.
Int. J. Found. Comput. Sci. 16(2): 321-341 (2005) |
| 59 | EE | Daniel Merkle,
Martin Middendorf:
On solving permutation scheduling problems with ant colony optimization.
Int. J. Systems Science 36(5): 255-266 (2005) |
| 58 | EE | Sebastian Lange,
Martin Middendorf:
Hyperreconfigurable architectures and the partition into hypercontexts problem.
J. Parallel Distrib. Comput. 65(6): 743-754 (2005) |
| 57 | EE | Jürgen Branke,
Martin Middendorf,
Guntram Noeth,
Maged M. Dessouky:
Waiting Strategies for Dynamic Vehicle Routing.
Transportation Science 39(3): 298-312 (2005) |
| 2004 |
|---|
| 56 | EE | Bernd Scheuermann,
Michael Guntsch,
Martin Middendorf,
Hartmut Schmeck:
Time-Scattered Heuristic for the Hardware Implementation of Population-Based ACO.
ANTS Workshop 2004: 250-261 |
| 55 | EE | Daniel Merkle,
Martin Middendorf:
Competition Controlled Pheromone Update for Ant Colony Optimization.
ANTS Workshop 2004: 95-105 |
| 54 | | Sebastian Lange,
Martin Middendorf:
Hyperreconfigurable Architectures as Flexible Control Systems.
ARCS Workshops 2004: 175-184 |
| 53 | EE | Stefan Janson,
Martin Middendorf:
A Hierarchical Particle Swarm Optimizer for Dynamic Optimization Problems.
EvoWorkshops 2004: 513-524 |
| 52 | EE | Sebastian Lange,
Martin Middendorf:
Hyperreconfigurable Architectures for Fast Run Time Reconfiguration.
FCCM 2004: 304-305 |
| 51 | EE | Sebastian Lange,
Martin Middendorf:
The Partition into Hypercontexts Problem for Hyperreconfigurable Architectures.
FPL 2004: 251-260 |
| 50 | EE | Daniel Merkle,
Martin Middendorf,
Alexander Scheidler:
Decentralized Packet Clustering in Networks.
IPDPS 2004 |
| 49 | EE | Sebastian Lange,
Martin Middendorf:
Models and Reconfiguration Problems for Multi Task Hyperreconfigurable Architectures.
IPDPS 2004 |
| 48 | EE | 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) |
| 47 | EE | Martin Middendorf,
David Manlove:
Combined super-/substring and super-/subsequence problems.
Theor. Comput. Sci. 320(2-3): 247-267 (2004) |
| 2003 |
|---|
| 46 | | 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
Springer 2003 |
| 45 | EE | Michael Guntsch,
Martin Middendorf:
Solving Multi-criteria Optimization Problems with Population-Based ACO.
EMO 2003: 464-478 |
| 44 | | Daniel Merkle,
Martin Middendorf:
Ant Colony Optimization with Global Pheromone Evaluation for Scheduling a Single Machine.
Appl. Intell. 18(1): 105-111 (2003) |
| 43 | EE | 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.
The Journal of Supercomputing 26(3): 221-238 (2003) |
| 2002 |
|---|
| 42 | | 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
Springer 2002 |
| 41 | EE | Michael Guntsch,
Martin Middendorf:
Applying Population Based ACO to Dynamic Optimization Problems.
Ant Algorithms 2002: 111-122 |
| 40 | EE | Daniel Merkle,
Martin Middendorf:
Modelling ACO: Composed Permutation Problems.
Ant Algorithms 2002: 149-162 |
| 39 | EE | Daniel Merkle,
Martin Middendorf:
Ant Colony Optimization with the Relative Pheromone Evaluation Method.
EvoWorkshops 2002: 325-333 |
| 38 | EE | Michael Guntsch,
Martin Middendorf:
A Population Based Approach for ACO.
EvoWorkshops 2002: 72-81 |
| 37 | | Daniel Merkle,
Martin Middendorf:
Studies On The Dynamics Of Ant Colony Optimization Algorithms.
GECCO 2002: 105-112 |
| 36 | | Daniel Merkle,
Martin Middendorf:
Modeling the Dynamics of Ant Colony Optimization.
Evolutionary Computation 10(3): 235-262 (2002) |
| 35 | | Daniel Merkle,
Martin Middendorf:
Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays.
Genetic Programming and Evolvable Machines 3(4): 345-361 (2002) |
| 34 | | Luca Maria Gambardella,
Marco Dorigo,
Martin Middendorf,
Thomas Stützle:
Guest editorial: special section on ant colony optimization.
IEEE Trans. Evolutionary Computation 6(4): 317-319 (2002) |
| 33 | | Daniel Merkle,
Martin Middendorf,
Hartmut Schmeck:
Ant colony optimization for resource-constrained project scheduling.
IEEE Trans. Evolutionary Computation 6(4): 333-346 (2002) |
| 32 | EE | 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) |
| 31 | | Martin Middendorf,
Frank Reischle,
Hartmut Schmeck:
Multi Colony Ant Algorithms.
J. Heuristics 8(3): 305-320 (2002) |
| 30 | EE | Martin Middendorf,
Bernd Scheuermann,
Hartmut Schmeck,
Hossam A. ElGindy:
An Evolutionary Approach to Dynamic Task Scheduling on FPGAs with Restricted Buffer.
J. Parallel Distrib. Comput. 62(9): 1407-1420 (2002) |
| 2001 |
|---|
| 29 | EE | Steffen Iredi,
Daniel Merkle,
Martin Middendorf:
Bi-Criterion Optimization with Multi Colony Ant Algorithms.
EMO 2001: 359-372 |
| 28 | EE | Michael Guntsch,
Martin Middendorf:
Pheromone Modification Strategies for Ant Algorithms Applied to Dynamic TSP.
EvoWorkshops 2001: 213-222 |
| 27 | EE | Daniel Merkle,
Martin Middendorf:
A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization.
EvoWorkshops 2001: 484-494 |
| 26 | | Daniel Merkle,
Martin Middendorf:
Fast ant colony optimization on reconfigurable processor arrays.
IPDPS 2001: 144 |
| 2000 |
|---|
| 25 | | Daniel Merkle,
Martin Middendorf:
An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems.
EvoWorkshops 2000: 287-296 |
| 24 | EE | Hossam A. ElGindy,
Martin Middendorf,
Hartmut Schmeck,
Bernd Schmidt:
Task Rearrangement on Partially Reconfigurable FPGAs with Restricted Buffer.
FPL 2000: 379-388 |
| 23 | | Daniel Merkle,
Martin Middendorf,
Hartmut Schmeck:
Ant Colony Optimization for Resource-Constrained Projet Scheduling.
GECCO 2000: 893- |
| 22 | EE | Martin Middendorf,
Frank Reischle,
Hartmut Schmeck:
Information Exchange in Multi Colony Ant Algorithms.
IPDPS Workshops 2000: 645-652 |
| 1999 |
|---|
| 21 | | Martin Middendorf:
Bit Summation on the Reconfigurable Mesh.
IPPS/SPDP Workshops 1999: 625-633 |
| 20 | | Martin Middendorf,
Vadim G. Timkovsky:
Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling Problems.
J. Comb. Optim. 3(4): 417-435 (1999) |
| 19 | EE | 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) |
| 1998 |
|---|
| 18 | EE | Wolf Zimmermann,
Martin Middendorf,
Welf Löwe:
On Optimal k-linear Scheduling of Tree-Like Graphs for LogP-Machines.
Euro-Par 1998: 328-336 |
| 17 | | Carsten Steckel,
Martin Middendorf,
Hossam A. ElGindy,
Hartmut Schmeck:
A Simulator for the Reconfigurable Mesh Architecture.
IPPS/SPDP Workshops 1998: 99-104 |
| 16 | EE | René Michel,
Martin Middendorf:
An Island Model Based Ant System with Lookahead for the Shortest Supersequence Problem.
PPSN 1998: 692-701 |
| 15 | | Martin Middendorf,
Hossam A. ElGindy:
Matrix Multiplication on Processor Arrays with Optical Buses.
Informatica (Slovenia) 22(3): (1998) |
| 14 | EE | Martin Middendorf:
Shortest Common Superstrings and Scheduling with Coordinated Starting Times.
Theor. Comput. Sci. 191(1-2): 205-214 (1998) |
| 1996 |
|---|
| 13 | EE | Martin Middendorf:
Manhattan Channel Routing is NP-complete Under Truly Restricted Settings.
Chicago J. Theor. Comput. Sci. 1996: (1996) |
| 12 | EE | Jonathan E. Atkins,
Martin Middendorf:
On Physical Mapping and the Consecutive Ones Property for Sparse Matrices.
Discrete Applied Mathematics 71(1-3): 23-40 (1996) |
| 11 | | Campbell Fraser,
Robert W. Irving,
Martin Middendorf:
Maximal Common Subsequences and Minimal Common Supersequences.
Inf. Comput. 124(2): 145-153 (1996) |
| 10 | EE | Martin Middendorf:
Two-Dimensional Partitioning Problems.
Theor. Comput. Sci. 164(1&2): 73-106 (1996) |
| 1995 |
|---|
| 9 | | Michael R. Fellows,
Jan Kratochvíl,
Martin Middendorf,
Frank Pfeiffer:
The Complexity of Induced Minors and Related Problems.
Algorithmica 13(3): 266-282 (1995) |
| 8 | | Martin Middendorf,
Hartmut Schmeck,
G. Turner:
Sparse Matrix Multiplication on a Reconfigurable Mesh.
Australian Computer Journal 27(2): 37-40 (1995) |
| 7 | EE | Martin Middendorf:
On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet.
Theor. Comput. Sci. 145(1&2): 317-327 (1995) |
| 1994 |
|---|
| 6 | EE | Martin Middendorf:
On the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences.
ISAAC 1994: 306-314 |
| 5 | | Martin Middendorf:
More on the Complexity of Common Superstring and Supersequence Problems.
Theor. Comput. Sci. 125(2): 205-228 (1994) |
| 1993 |
|---|
| 4 | | Martin Middendorf:
Minimum Broadcast Time is NP-Complete for 3-Regular Planar Graphs and Deadline 2.
Inf. Process. Lett. 46(6): 281-287 (1993) |
| 3 | | Hartmut Schmeck,
Heiko Schröder,
Jørgen Staunstrup,
Martin Middendorf:
Problem Heaps and Their Evaluation.
Parallel Processing Letters 3: 147-155 (1993) |
| 2 | | Martin Middendorf:
The Shortest Common Nonsubsequence Problem is NP-Complete.
Theor. Comput. Sci. 108(2): 365-369 (1993) |
| 1992 |
|---|
| 1 | | Jürgen Duske,
Martin Middendorf,
Rainer Parchmann:
Indexed counter languages.
ITA 26: 93-114 (1992) |
