2009 |
38 | EE | Steffen Wolf,
Peter Merz:
Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks.
EvoCOP 2009: 192-203 |
2008 |
37 | EE | Mathias Dalheimer,
Franz-Josef Pfreundt,
Peter Merz:
Formal Verification of a Grid Resource Allocation Protocol.
CCGRID 2008: 332-339 |
36 | EE | Peter Merz,
Jan Ubben,
Matthias Priebe:
On the Construction of a Super-Peer Topology underneath Middleware for Distributed Computing.
CCGRID 2008: 590-595 |
35 | EE | Kerstin Bauer,
Thomas Fischer,
Sven Oliver Krumke,
Katharina Gerhardt,
Stephan Westphal,
Peter Merz:
Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem.
EvoCOP 2008: 158-169 |
34 | EE | Steffen Wolf,
Peter Merz:
Evolutionary Local Search for the Minimum Energy Broadcast Problem.
EvoCOP 2008: 61-72 |
33 | EE | Peter Merz,
Matthias Priebe,
Steffen Wolf:
Super-Peer Selection in Peer-to-Peer Networks Using Network Coordinates.
ICIW 2008: 385-390 |
32 | EE | Peter Merz,
Steffen Wolf,
Dennis Schwerdel,
Matthias Priebe:
A Self-Organizing Super-Peer Overlay with a Chord Core for Desktop Grids.
IWSOS 2008: 23-34 |
31 | EE | Peter Merz,
Matthias Priebe,
Steffen Wolf:
A Simulation Framework for Distributed Super-Peer Topology Construction Using Network Coordinates.
PDP 2008: 491-498 |
30 | EE | Thomas Fischer,
Kerstin Bauer,
Peter Merz:
A Distributed Memetic Algorithm for the Routing and Wavelength Assignment Problem.
PPSN 2008: 879-888 |
29 | EE | Peter Merz,
Jutta Huhse:
An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances.
PPSN 2008: 929-939 |
28 | EE | Thomas Fischer,
Kerstin Bauer,
Peter Merz:
A Multilevel Approach for the Routing and Wavelength Assignment Problem.
SAINT 2008: 225-228 |
27 | EE | Thomas Fischer,
Peter Merz:
Reducing the Size of Travelling Salesman Problem Instances by Fixing Edges.
Recent Advances in Evolutionary Computation for Combinatorial Optimization 2008: 243-258 |
2007 |
26 | EE | Steffen Wolf,
Peter Merz:
A Hybrid Method for Solving Large-Scale Supply Chain Problems.
EvoCOP 2007: 219-228 |
25 | EE | Thomas Fischer,
Peter Merz:
Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges.
EvoCOP 2007: 72-83 |
24 | EE | Steffen Wolf,
Peter Merz:
Evolutionary Local Search for the Super-Peer Selection Problem and the p -Hub Median Problem.
Hybrid Metaheuristics 2007: 1-15 |
23 | EE | Thomas Fischer,
Peter Merz:
A Memetic Algorithm for the Optimum Communication Spanning Tree Problem.
Hybrid Metaheuristics 2007: 170-184 |
22 | EE | Peter Merz,
Matthias Priebe:
A New Iterative Method to Improve Network Coordinates-Based Internet Distance Estimation.
ISPDC 2007: 169-176 |
21 | EE | Sameh Al-Shihabi,
Peter Merz,
Steffen Wolf:
Nested Partitioning for the Minimum Energy Broadcast Problem.
LION 2007: 1-11 |
20 | EE | Sven Oliver Krumke,
Peter Merz,
Tim Nonner,
Katharina Rupp:
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs.
OPODIS 2007: 159-173 |
19 | EE | Peter Merz,
Katja Gorunova:
Fault-tolerant Resource Discovery in Peer-to-peer Grids.
J. Grid Comput. 5(3): 319-335 (2007) |
2006 |
18 | EE | Thomas Fischer,
Stephan Fudeus,
Peter Merz:
A Middleware for Job Distribution in Peer-to-Peer Networks.
PARA 2006: 1147-1157 |
17 | EE | Peter Merz,
Steffen Wolf:
Evolutionary Local Search for Designing Peer-to-Peer Overlay Topologies Based on Minimum Routing Cost Spanning Trees.
PPSN 2006: 272-281 |
2005 |
16 | EE | Peter Merz,
Katja Gorunova:
Efficient broadcast in P2P grids.
CCGRID 2005: 237-242 |
15 | EE | Thomas Fischer,
Peter Merz:
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems.
IPDPS 2005 |
14 | EE | Mathias Dalheimer,
Franz-Josef Pfreundt,
Peter Merz:
Agent-Based Grid Scheduling with Calana.
PPAM 2005: 741-750 |
13 | EE | Peter Merz,
Katja Gorunova:
Reliable Multicast and Its Probabilistic Model for Job Submission in Peer-to-Peer Grids.
WISE 2005: 504-511 |
2004 |
12 | EE | Peter Merz:
Advanced Fitness Landscape Analysis and the Performance of Memetic Algorithms.
Evolutionary Computation 12(3): 303-325 (2004) |
2003 |
11 | EE | Peter Merz:
An Iterated Local Search Approach for Minimum Sum-of-Squares Clustering.
IDA 2003: 286-296 |
2002 |
10 | | Peter Merz:
A Comparison Of Memetic Recombination Operators For The Traveling Salesman Problem.
GECCO 2002: 472-479 |
9 | EE | Jutta Huhse,
Thomas Villmann,
Peter Merz,
Andreas Zell:
Evolution Strategy with Neighborhood Attraction Using a Neural Gas Approach.
PPSN 2002: 391-400 |
8 | EE | Peter Merz,
Andreas Zell:
Clustering Gene Expression Profiles with Memetic Algorithms.
PPSN 2002: 811-820 |
7 | | Peter Merz,
Bernd Freisleben:
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming.
J. Heuristics 8(2): 197-213 (2002) |
2000 |
6 | | Peter Merz,
Bernd Freisleben:
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning.
Evolutionary Computation 8(1): 61-91 (2000) |
5 | | Peter Merz,
Bernd Freisleben:
Fitness landscape analysis and memetic algorithms for the quadratic assignment problem.
IEEE Trans. Evolutionary Computation 4(4): 337-352 (2000) |
1998 |
4 | EE | Peter Merz,
Bernd Freisleben:
Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem.
PPSN 1998: 765-774 |
1997 |
3 | | Peter Merz,
Bernd Freisleben:
A Genetic Local Search Approach to the Quadratic Assignment Problem.
ICGA 1997: 465-472 |
1996 |
2 | | Bernd Freisleben,
Peter Merz:
A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems.
International Conference on Evolutionary Computation 1996: 616-621 |
1 | | Bernd Freisleben,
Peter Merz:
New Genetic Local Search Operators for the Traveling Salesman Problem.
PPSN 1996: 890-899 |