The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Middendorf: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  76. Learning from House-Hunting Ants: Collective Decision-Making in Organic Computing Systems. [Citation Graph (, )][DBLP]


  77. Emergent Sorting in Networks of Router Agents. [Citation Graph (, )][DBLP]


  78. Finding All Sorting Tandem Duplication Random Loss Operations. [Citation Graph (, )][DBLP]


  79. Hyperreconfigurable architectures. [Citation Graph (, )][DBLP]


  80. Evolved cooperation and emergent communication structures in learning classifier based organic computing systems. [Citation Graph (, )][DBLP]


  81. An Algorithm for Inferring Mitogenome Rearrangements in a Phylogenetic Tree. [Citation Graph (, )][DBLP]


  82. Evaluation of Ordering Methods for DNA Sequence Design Based on Ant Colony System. [Citation Graph (, )][DBLP]


  83. An ant colony optimizer for melody creation with baroque harmony. [Citation Graph (, )][DBLP]


  84. Artificial Bee Colony Optimization: A New Selection Scheme and Its Performance. [Citation Graph (, )][DBLP]


  85. Molecular docking with multi-objective Particle Swarm Optimization. [Citation Graph (, )][DBLP]


  86. CREx: inferring genomic rearrangements based on common intervals. [Citation Graph (, )][DBLP]


  87. A parameter-adaptive dynamic programming approach for inferring cophylogenies. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.017secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002