---
_id: '48845'
abstract:
- lang: eng
text: In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems
(VRPs) often imply repeated decision making on dynamic customer requests. As in
classical VRPs, tours have to be planned short while the number of serviced customers
has to be maximized at the same time resulting in a multi-objective problem. Beyond
that, however, dynamic requests lead to the need for re-planning of not yet realized
tour parts, while already realized tour parts are irreversible. In this paper
we study this type of bi-objective dynamic VRP including sequential decision making
and concurrent realization of decisions. We adopt a recently proposed Dynamic
Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend
it to the more realistic (here considered) scenario of multiple vehicles. We empirically
show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant
variant of the proposed DEMOA as well as with the dynamic single-vehicle approach
proposed earlier.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple
Vehicles. In: Proceedings of the Genetic and Evolutionary Computation Conference.
GECCO ’20. Association for Computing Machinery; 2020:166–174. doi:10.1145/3377930.3390146'
apa: Bossek, J., Grimme, C., & Trautmann, H. (2020). Dynamic Bi-Objective Routing
of Multiple Vehicles. Proceedings of the Genetic and Evolutionary Computation
Conference, 166–174. https://doi.org/10.1145/3377930.3390146
bibtex: '@inproceedings{Bossek_Grimme_Trautmann_2020, place={New York, NY, USA},
series={GECCO ’20}, title={Dynamic Bi-Objective Routing of Multiple Vehicles},
DOI={10.1145/3377930.3390146},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme,
Christian and Trautmann, Heike}, year={2020}, pages={166–174}, collection={GECCO
’20} }'
chicago: 'Bossek, Jakob, Christian Grimme, and Heike Trautmann. “Dynamic Bi-Objective
Routing of Multiple Vehicles.” In Proceedings of the Genetic and Evolutionary
Computation Conference, 166–174. GECCO ’20. New York, NY, USA: Association
for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390146.'
ieee: 'J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of
Multiple Vehicles,” in Proceedings of the Genetic and Evolutionary Computation
Conference, 2020, pp. 166–174, doi: 10.1145/3377930.3390146.'
mla: Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.”
Proceedings of the Genetic and Evolutionary Computation Conference, Association
for Computing Machinery, 2020, pp. 166–174, doi:10.1145/3377930.3390146.
short: 'J. Bossek, C. Grimme, H. Trautmann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2020, pp. 166–174.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:43:24Z
department:
- _id: '819'
doi: 10.1145/3377930.3390146
extern: '1'
keyword:
- decision making
- dynamic optimization
- evolutionary algorithms
- multi-objective optimization
- vehicle routing
language:
- iso: eng
page: 166–174
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’20
status: public
title: Dynamic Bi-Objective Routing of Multiple Vehicles
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48852'
abstract:
- lang: eng
text: The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial
optimisation problems. However, many real-world problems are composed of several
interacting components. The Traveling Thief Problem (TTP) addresses such interactions
by combining two combinatorial optimisation problems, namely the TSP and the Knapsack
Problem (KP). Recently, a new problem called the node weight dependent Traveling
Salesperson Problem (W-TSP) has been introduced where nodes have weights that
influence the cost of the tour. In this paper, we compare W-TSP and TTP. We investigate
the structure of the optimised tours for W-TSP and TTP and the impact of using
each others fitness function. Our experimental results suggest (1) that the W-TSP
often can be solved better using the TTP fitness function and (2) final W-TSP
and TTP solutions show different distributions when compared with optimal TSP
or weighted greedy solutions.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Neumann A, Neumann F. Optimising Tours for the Weighted Traveling
Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of
Solutions. In: Parallel Problem Solving from Nature (PPSN XVI). Springer-Verlag;
2020:346–359. doi:10.1007/978-3-030-58112-1_24'
apa: 'Bossek, J., Neumann, A., & Neumann, F. (2020). Optimising Tours for the
Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural
Comparison of Solutions. Parallel Problem Solving from Nature (PPSN XVI),
346–359. https://doi.org/10.1007/978-3-030-58112-1_24'
bibtex: '@inproceedings{Bossek_Neumann_Neumann_2020, place={Berlin, Heidelberg},
title={Optimising Tours for the Weighted Traveling Salesperson Problem and the
Traveling Thief Problem: A Structural Comparison of Solutions}, DOI={10.1007/978-3-030-58112-1_24},
booktitle={Parallel Problem Solving from Nature (PPSN XVI)}, publisher={Springer-Verlag},
author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={346–359}
}'
chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Optimising Tours for
the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A
Structural Comparison of Solutions.” In Parallel Problem Solving from Nature
(PPSN XVI), 346–359. Berlin, Heidelberg: Springer-Verlag, 2020. https://doi.org/10.1007/978-3-030-58112-1_24.'
ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Optimising Tours for the Weighted
Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison
of Solutions,” in Parallel Problem Solving from Nature (PPSN XVI), 2020,
pp. 346–359, doi: 10.1007/978-3-030-58112-1_24.'
mla: 'Bossek, Jakob, et al. “Optimising Tours for the Weighted Traveling Salesperson
Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.”
Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, 2020,
pp. 346–359, doi:10.1007/978-3-030-58112-1_24.'
short: 'J. Bossek, A. Neumann, F. Neumann, in: Parallel Problem Solving from Nature
(PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp. 346–359.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:44:54Z
department:
- _id: '819'
doi: 10.1007/978-3-030-58112-1_24
extern: '1'
keyword:
- Evolutionary algorithms
- Node weight dependent TSP
- Traveling Thief Problem
language:
- iso: eng
page: 346–359
place: Berlin, Heidelberg
publication: Parallel Problem Solving from Nature (PPSN XVI)
publication_identifier:
isbn:
- 978-3-030-58111-4
publication_status: published
publisher: Springer-Verlag
status: public
title: 'Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling
Thief Problem: A Structural Comparison of Solutions'
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48879'
abstract:
- lang: eng
text: Evolving diverse sets of high quality solutions has gained increasing interest
in the evolutionary computation literature in recent years. With this paper, we
contribute to this area of research by examining evolutionary diversity optimisation
approaches for the classical Traveling Salesperson Problem (TSP). We study the
impact of using different diversity measures for a given set of tours and the
ability of evolutionary algorithms to obtain a diverse set of high quality solutions
when adopting these measures. Our studies show that a large variety of diverse
high quality tours can be achieved by using our approaches. Furthermore, we compare
our approaches in terms of theoretical properties and the final set of tours obtained
by the evolutionary diversity optimisation algorithm.
author:
- first_name: Anh Viet
full_name: Do, Anh Viet
last_name: Do
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Do AV, Bossek J, Neumann A, Neumann F. Evolving Diverse Sets of Tours for
the Travelling Salesperson Problem. In: Proceedings of the Genetic and Evolutionary
Computation Conference. GECCO’20. Association for Computing Machinery; 2020:681–689.
doi:10.1145/3377930.3389844'
apa: Do, A. V., Bossek, J., Neumann, A., & Neumann, F. (2020). Evolving Diverse
Sets of Tours for the Travelling Salesperson Problem. Proceedings of the Genetic
and Evolutionary Computation Conference, 681–689. https://doi.org/10.1145/3377930.3389844
bibtex: '@inproceedings{Do_Bossek_Neumann_Neumann_2020, place={New York, NY, USA},
series={GECCO’20}, title={Evolving Diverse Sets of Tours for the Travelling Salesperson
Problem}, DOI={10.1145/3377930.3389844},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Do, Anh Viet and Bossek,
Jakob and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={681–689}, collection={GECCO’20}
}'
chicago: 'Do, Anh Viet, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Evolving
Diverse Sets of Tours for the Travelling Salesperson Problem.” In Proceedings
of the Genetic and Evolutionary Computation Conference, 681–689. GECCO’20.
New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3389844.'
ieee: 'A. V. Do, J. Bossek, A. Neumann, and F. Neumann, “Evolving Diverse Sets of
Tours for the Travelling Salesperson Problem,” in Proceedings of the Genetic
and Evolutionary Computation Conference, 2020, pp. 681–689, doi: 10.1145/3377930.3389844.'
mla: Do, Anh Viet, et al. “Evolving Diverse Sets of Tours for the Travelling Salesperson
Problem.” Proceedings of the Genetic and Evolutionary Computation Conference,
Association for Computing Machinery, 2020, pp. 681–689, doi:10.1145/3377930.3389844.
short: 'A.V. Do, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2020, pp. 681–689.'
date_created: 2023-11-14T15:58:58Z
date_updated: 2023-12-13T10:48:50Z
department:
- _id: '819'
doi: 10.1145/3377930.3389844
extern: '1'
keyword:
- diversity maximisation
- evolutionary algorithms
- travelling salesperson problem
language:
- iso: eng
page: 681–689
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publisher: Association for Computing Machinery
series_title: GECCO’20
status: public
title: Evolving Diverse Sets of Tours for the Travelling Salesperson Problem
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48895'
abstract:
- lang: eng
text: Evolutionary algorithms (EAs) are general-purpose problem solvers that usually
perform an unbiased search. This is reasonable and desirable in a black-box scenario.
For combinatorial optimization problems, often more knowledge about the structure
of optimal solutions is given, which can be leveraged by means of biased search
operators. We consider the Minimum Spanning Tree (MST) problem in a single- and
multi-objective version, and introduce a biased mutation, which puts more emphasis
on the selection of edges of low rank in terms of low domination number. We present
example graphs where the biased mutation can significantly speed up the expected
runtime until (Pareto-)optimal solutions are found. On the other hand, we demonstrate
that bias can lead to exponential runtime if "heavy" edges are necessarily part
of an optimal solution. However, on general graphs in the single-objective setting,
we show that a combined mutation operator which decides for unbiased or biased
edge selection in each step with equal probability exhibits a polynomial upper
bound - as unbiased mutation - in the worst case and benefits from bias if the
circumstances are favorable.
author:
- first_name: Vahid
full_name: Roostapour, Vahid
last_name: Roostapour
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Roostapour V, Bossek J, Neumann F. Runtime Analysis of Evolutionary Algorithms
with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. In:
Proceedings of the 2020 Genetic and Evolutionary Computation Conference.
{GECCO} ’20. Association for Computing Machinery; 2020:551–559. doi:10.1145/3377930.3390168'
apa: Roostapour, V., Bossek, J., & Neumann, F. (2020). Runtime Analysis of Evolutionary
Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree
Problem. Proceedings of the 2020 Genetic and Evolutionary Computation Conference,
551–559. https://doi.org/10.1145/3377930.3390168
bibtex: '@inproceedings{Roostapour_Bossek_Neumann_2020, place={New York, NY, USA},
series={{GECCO} ’20}, title={Runtime Analysis of Evolutionary Algorithms with
Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem}, DOI={10.1145/3377930.3390168}, booktitle={Proceedings
of the 2020 Genetic and Evolutionary Computation Conference}, publisher={Association
for Computing Machinery}, author={Roostapour, Vahid and Bossek, Jakob and Neumann,
Frank}, year={2020}, pages={551–559}, collection={{GECCO} ’20} }'
chicago: 'Roostapour, Vahid, Jakob Bossek, and Frank Neumann. “Runtime Analysis
of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum
Spanning Tree Problem.” In Proceedings of the 2020 Genetic and Evolutionary
Computation Conference, 551–559. {GECCO} ’20. New York, NY, USA: Association
for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390168.'
ieee: 'V. Roostapour, J. Bossek, and F. Neumann, “Runtime Analysis of Evolutionary
Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree
Problem,” in Proceedings of the 2020 Genetic and Evolutionary Computation Conference,
2020, pp. 551–559, doi: 10.1145/3377930.3390168.'
mla: Roostapour, Vahid, et al. “Runtime Analysis of Evolutionary Algorithms with
Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.” Proceedings
of the 2020 Genetic and Evolutionary Computation Conference, Association for
Computing Machinery, 2020, pp. 551–559, doi:10.1145/3377930.3390168.
short: 'V. Roostapour, J. Bossek, F. Neumann, in: Proceedings of the 2020 Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2020, pp. 551–559.'
date_created: 2023-11-14T15:59:00Z
date_updated: 2023-12-13T10:49:38Z
department:
- _id: '819'
doi: 10.1145/3377930.3390168
extern: '1'
keyword:
- biased mutation
- evolutionary algorithms
- minimum spanning tree problem
- runtime analysis
language:
- iso: eng
page: 551–559
place: New York, NY, USA
publication: Proceedings of the 2020 Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publisher: Association for Computing Machinery
series_title: '{GECCO} ’20'
status: public
title: Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective
Minimum Spanning Tree Problem
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '17667'
abstract:
- lang: eng
text: 'Resolving distributed attacks benefits from collaboration between networks.
We present three approaches for the same multi-domain defensive action that can
be applied in such an alliance: 1) Counteract Everywhere, 2) Minimize Countermeasures,
and 3) Minimize Propagation. First, we provide a formula to compute efficiency
of a defense; then we use this formula to compute the efficiency of the approaches
under various circumstances. Finally, we discuss how task execution order and
timing influence defense efficiency. Our results show that the Minimize Propagation
approach is the most efficient method when defending against the chosen attack.'
author:
- first_name: Ralph
full_name: Koning, Ralph
last_name: Koning
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
- first_name: Lydia
full_name: Meijer, Lydia
last_name: Meijer
- first_name: Cees
full_name: de Laat, Cees
last_name: de Laat
- first_name: Paola
full_name: Grosso, Paola
last_name: Grosso
citation:
ama: 'Koning R, Polevoy G, Meijer L, de Laat C, Grosso P. Approaches for Collaborative
Security Defences in Multi Network Environments. In: 2019 6th IEEE International
Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International
Conference on Edge Computing and Scalable Cloud (EdgeCom). 2019 6th IEEE International
Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019 5th IEEE International
Conference on Edge Computing and Scalable Cloud (EdgeCom). ; 2019:113-123. doi:10.1109/CSCloud/EdgeCom.2019.000-9'
apa: Koning, R., Polevoy, G., Meijer, L., de Laat, C., & Grosso, P. (2019).
Approaches for Collaborative Security Defences in Multi Network Environments.
In 2019 6th IEEE International Conference on Cyber Security and Cloud Computing
(CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable
Cloud (EdgeCom) (pp. 113–123). https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9
bibtex: '@inproceedings{Koning_Polevoy_Meijer_de Laat_Grosso_2019, series={2019
6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/
2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)},
title={Approaches for Collaborative Security Defences in Multi Network Environments},
DOI={10.1109/CSCloud/EdgeCom.2019.000-9},
booktitle={2019 6th IEEE International Conference on Cyber Security and Cloud
Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge Computing
and Scalable Cloud (EdgeCom)}, author={Koning, Ralph and Polevoy, Gleb and Meijer,
Lydia and de Laat, Cees and Grosso, Paola}, year={2019}, pages={113–123}, collection={2019
6th IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/
2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom)}
}'
chicago: Koning, Ralph, Gleb Polevoy, Lydia Meijer, Cees de Laat, and Paola Grosso.
“Approaches for Collaborative Security Defences in Multi Network Environments.”
In 2019 6th IEEE International Conference on Cyber Security and Cloud Computing
(CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable
Cloud (EdgeCom), 113–23. 2019 6th IEEE International Conference on Cyber Security
and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge
Computing and Scalable Cloud (EdgeCom), 2019. https://doi.org/10.1109/CSCloud/EdgeCom.2019.000-9.
ieee: R. Koning, G. Polevoy, L. Meijer, C. de Laat, and P. Grosso, “Approaches for
Collaborative Security Defences in Multi Network Environments,” in 2019 6th
IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)/
2019 5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom),
2019, pp. 113–123.
mla: Koning, Ralph, et al. “Approaches for Collaborative Security Defences in Multi
Network Environments.” 2019 6th IEEE International Conference on Cyber Security
and Cloud Computing (CSCloud)/ 2019 5th IEEE International Conference on Edge
Computing and Scalable Cloud (EdgeCom), 2019, pp. 113–23, doi:10.1109/CSCloud/EdgeCom.2019.000-9.
short: 'R. Koning, G. Polevoy, L. Meijer, C. de Laat, P. Grosso, in: 2019 6th IEEE
International Conference on Cyber Security and Cloud Computing (CSCloud)/ 2019
5th IEEE International Conference on Edge Computing and Scalable Cloud (EdgeCom),
2019, pp. 113–123.'
conference:
name: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing
(CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable
Cloud (EdgeCom)
date_created: 2020-08-06T15:23:23Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/CSCloud/EdgeCom.2019.000-9
extern: '1'
keyword:
- computer network security
- multinetwork environments
- multidomain defensive action
- task execution order
- timing influence defense efficiency
- distributed attacks
- collaborative security defence approach
- minimize propagation approach
- minimize countermeasure approach
- counteract everywhere approach
- Conferences
- Cloud computing
- Computer crime
- Edge computing
- Security
- Defense Approaches
- Multi-Domain Defense
- Collaborative Defense
- Defense Algorithms
- Computer Networks
language:
- iso: eng
main_file_link:
- url: https://ieeexplore.ieee.org/abstract/document/8854057/authors#authors
page: 113-123
publication: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing
(CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable
Cloud (EdgeCom)
publication_identifier:
issn:
- 'null'
quality_controlled: '1'
series_title: 2019 6th IEEE International Conference on Cyber Security and Cloud Computing
(CSCloud)/ 2019 5th IEEE International Conference on Edge Computing and Scalable
Cloud (EdgeCom)
status: public
title: Approaches for Collaborative Security Defences in Multi Network Environments
type: conference
user_id: '83983'
year: '2019'
...
---
_id: '10586'
abstract:
- lang: eng
text: We consider the problem of transforming a given graph G_s into a desired graph
G_t by applying a minimum number of primitives from a particular set of local
graph transformation primitives. These primitives are local in the sense that
each node can apply them based on local knowledge and by affecting only its 1-neighborhood.
Although the specific set of primitives we consider makes it possible to transform
any (weakly) connected graph into any other (weakly) connected graph consisting
of the same nodes, they cannot disconnect the graph or introduce new nodes into
the graph, making them ideal in the context of supervised overlay network transformations.
We prove that computing a minimum sequence of primitive applications (even centralized)
for arbitrary G_s and G_t is NP-hard, which we conjecture to hold for any set
of local graph transformation primitives satisfying the aforementioned properties.
On the other hand, we show that this problem admits a polynomial time algorithm
with a constant approximation ratio.
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Alexander
full_name: Setzer, Alexander
id: '11108'
last_name: Setzer
citation:
ama: 'Scheideler C, Setzer A. On the Complexity of Local Graph Transformations.
In: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming. Vol 132. LIPIcs. Dagstuhl Publishing; 2019:150:1--150:14.
doi:10.4230/LIPICS.ICALP.2019.150'
apa: 'Scheideler, C., & Setzer, A. (2019). On the Complexity of Local Graph
Transformations. In Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece:
Dagstuhl Publishing. https://doi.org/10.4230/LIPICS.ICALP.2019.150'
bibtex: '@inproceedings{Scheideler_Setzer_2019, series={LIPIcs}, title={On the Complexity
of Local Graph Transformations}, volume={132}, DOI={10.4230/LIPICS.ICALP.2019.150},
booktitle={Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming}, publisher={Dagstuhl Publishing}, author={Scheideler, Christian
and Setzer, Alexander}, year={2019}, pages={150:1--150:14}, collection={LIPIcs}
}'
chicago: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local
Graph Transformations.” In Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl
Publishing, 2019. https://doi.org/10.4230/LIPICS.ICALP.2019.150.
ieee: C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,”
in Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
mla: Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph
Transformations.” Proceedings of the 46th International Colloquium on Automata,
Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14,
doi:10.4230/LIPICS.ICALP.2019.150.
short: 'C. Scheideler, A. Setzer, in: Proceedings of the 46th International Colloquium
on Automata, Languages, and Programming, Dagstuhl Publishing, 2019, pp. 150:1--150:14.'
conference:
end_date: 2019-07-12
location: Patras, Greece
name: ICALP 2019
start_date: 2019-07-09
date_created: 2019-07-08T17:19:01Z
date_updated: 2022-01-06T06:50:45Z
ddc:
- '004'
department:
- _id: '79'
doi: 10.4230/LIPICS.ICALP.2019.150
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2019-08-26T09:21:27Z
date_updated: 2019-08-26T09:21:27Z
file_id: '12955'
file_name: LIPIcs-ICALP-2019-150.pdf
file_size: 537649
relation: main_file
success: 1
file_date_updated: 2019-08-26T09:21:27Z
has_accepted_license: '1'
intvolume: ' 132'
keyword:
- Graphs transformations
- NP-hardness
- approximation algorithms
language:
- iso: eng
page: 150:1--150:14
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subproject A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 46th International Colloquium on Automata, Languages,
and Programming
publication_status: published
publisher: Dagstuhl Publishing
series_title: LIPIcs
status: public
title: On the Complexity of Local Graph Transformations
type: conference
user_id: '477'
volume: 132
year: '2019'
...
---
_id: '48843'
abstract:
- lang: eng
text: We contribute to the theoretical understanding of randomized search heuristics
for dynamic problems. We consider the classical graph coloring problem and investigate
the dynamic setting where edges are added to the current graph. We then analyze
the expected time for randomized search heuristics to recompute high quality solutions.
This includes the (1+1) EA and RLS in a setting where the number of colors is
bounded and we are minimizing the number of conflicts as well as iterated local
search algorithms that use an unbounded color palette and aim to use the smallest
colors and - as a consequence - the smallest number of colors. We identify classes
of bipartite graphs where reoptimization is as hard as or even harder than optimization
from scratch, i. e. starting with a random initialization. Even adding a single
edge can lead to hard symmetry problems. However, graph classes that are hard
for one algorithm turn out to be easy for others. In most cases our bounds show
that reoptimization is faster than optimizing from scratch. Furthermore, we show
how to speed up computations by using problem specific operators concentrating
on parts of the graph where changes have occurred.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Pan
full_name: Peng, Pan
last_name: Peng
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
citation:
ama: 'Bossek J, Neumann F, Peng P, Sudholt D. Runtime Analysis of Randomized Search
Heuristics for Dynamic Graph Coloring. In: Proceedings of the Genetic and Evolutionary
Computation Conference. GECCO ’19. Association for Computing Machinery; 2019:1443–1451.
doi:10.1145/3321707.3321792'
apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2019). Runtime Analysis
of Randomized Search Heuristics for Dynamic Graph Coloring. Proceedings of
the Genetic and Evolutionary Computation Conference, 1443–1451. https://doi.org/10.1145/3321707.3321792
bibtex: '@inproceedings{Bossek_Neumann_Peng_Sudholt_2019, place={New York, NY, USA},
series={GECCO ’19}, title={Runtime Analysis of Randomized Search Heuristics for
Dynamic Graph Coloring}, DOI={10.1145/3321707.3321792},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Frank and Peng, Pan and Sudholt, Dirk}, year={2019}, pages={1443–1451}, collection={GECCO
’19} }'
chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis
of Randomized Search Heuristics for Dynamic Graph Coloring.” In Proceedings
of the Genetic and Evolutionary Computation Conference, 1443–1451. GECCO ’19.
New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321792.'
ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized
Search Heuristics for Dynamic Graph Coloring,” in Proceedings of the Genetic
and Evolutionary Computation Conference, 2019, pp. 1443–1451, doi: 10.1145/3321707.3321792.'
mla: Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for
Dynamic Graph Coloring.” Proceedings of the Genetic and Evolutionary Computation
Conference, Association for Computing Machinery, 2019, pp. 1443–1451, doi:10.1145/3321707.3321792.
short: 'J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2019, pp. 1443–1451.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:42:37Z
department:
- _id: '819'
doi: 10.1145/3321707.3321792
extern: '1'
keyword:
- dynamic optimization
- evolutionary algorithms
- running time analysis
- theory
language:
- iso: eng
page: 1443–1451
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-6111-8
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’19
status: public
title: Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '2367'
abstract:
- lang: eng
text: One of the most popular fuzzy clustering techniques is the fuzzy K-means algorithm
(also known as fuzzy-c-means or FCM algorithm). In contrast to the K-means and
K-median problem, the underlying fuzzy K-means problem has not been studied from
a theoretical point of view. In particular, there are no algorithms with approximation
guarantees similar to the famous K-means++ algorithm known for the fuzzy K-means
problem. This work initiates the study of the fuzzy K-means problem from an algorithmic
and complexity theoretic perspective. We show that optimal solutions for the fuzzy
K-means problem cannot, in general, be expressed by radicals over the input points.
Surprisingly, this already holds for simple inputs in one-dimensional space. Hence,
one cannot expect to compute optimal solutions exactly. We give the first (1+eps)-approximation
algorithms for the fuzzy K-means problem. First, we present a deterministic approximation
algorithm whose runtime is polynomial in N and linear in the dimension D of the
input set, given that K is constant, i.e. a polynomial time approximation scheme
(PTAS) for fixed K. We achieve this result by showing that for each soft clustering
there exists a hard clustering with similar properties. Second, by using techniques
known from coreset constructions for the K-means problem, we develop a deterministic
approximation algorithm that runs in time almost linear in N but exponential in
the dimension D. We complement these results with a randomized algorithm which
imposes some natural restrictions on the sought solution and whose runtime is
comparable to some of the most efficient approximation algorithms for K-means,
i.e. linear in the number of points and the dimension, but exponential in the
number of clusters.
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Sascha
full_name: Brauer, Sascha
id: '13291'
last_name: Brauer
- first_name: Kathrin
full_name: Bujna, Kathrin
last_name: Bujna
citation:
ama: 'Blömer J, Brauer S, Bujna K. A Theoretical Analysis of the Fuzzy K-Means Problem.
In: 2016 IEEE 16th International Conference on Data Mining (ICDM). IEEE;
2016:805-810. doi:10.1109/icdm.2016.0094'
apa: 'Blömer, J., Brauer, S., & Bujna, K. (2016). A Theoretical Analysis of
the Fuzzy K-Means Problem. In 2016 IEEE 16th International Conference on Data
Mining (ICDM) (pp. 805–810). Barcelona, Spain: IEEE. https://doi.org/10.1109/icdm.2016.0094'
bibtex: '@inproceedings{Blömer_Brauer_Bujna_2016, title={A Theoretical Analysis
of the Fuzzy K-Means Problem}, DOI={10.1109/icdm.2016.0094},
booktitle={2016 IEEE 16th International Conference on Data Mining (ICDM)}, publisher={IEEE},
author={Blömer, Johannes and Brauer, Sascha and Bujna, Kathrin}, year={2016},
pages={805–810} }'
chicago: Blömer, Johannes, Sascha Brauer, and Kathrin Bujna. “A Theoretical Analysis
of the Fuzzy K-Means Problem.” In 2016 IEEE 16th International Conference on
Data Mining (ICDM), 805–10. IEEE, 2016. https://doi.org/10.1109/icdm.2016.0094.
ieee: J. Blömer, S. Brauer, and K. Bujna, “A Theoretical Analysis of the Fuzzy K-Means
Problem,” in 2016 IEEE 16th International Conference on Data Mining (ICDM),
Barcelona, Spain, 2016, pp. 805–810.
mla: Blömer, Johannes, et al. “A Theoretical Analysis of the Fuzzy K-Means Problem.”
2016 IEEE 16th International Conference on Data Mining (ICDM), IEEE, 2016,
pp. 805–10, doi:10.1109/icdm.2016.0094.
short: 'J. Blömer, S. Brauer, K. Bujna, in: 2016 IEEE 16th International Conference
on Data Mining (ICDM), IEEE, 2016, pp. 805–810.'
conference:
end_date: 2016-12-15
location: Barcelona, Spain
name: IEEE 16th International Conference on Data Mining (ICDM)
start_date: 2016-12-12
date_created: 2018-04-17T11:46:07Z
date_updated: 2022-01-06T06:55:58Z
department:
- _id: '64'
doi: 10.1109/icdm.2016.0094
keyword:
- unsolvability by radicals
- clustering
- fuzzy k-means
- probabilistic method
- approximation algorithms
- randomized algorithms
language:
- iso: eng
page: 805-810
publication: 2016 IEEE 16th International Conference on Data Mining (ICDM)
publication_identifier:
isbn:
- '9781509054732'
publication_status: published
publisher: IEEE
status: public
title: A Theoretical Analysis of the Fuzzy K-Means Problem
type: conference
user_id: '25078'
year: '2016'
...
---
_id: '17657'
abstract:
- lang: eng
text: Inter-datacenter transfers of non-interactive but timely large flows over
a private (managed) network is an important problem faced by many cloud service
providers. The considered flows are non-interactive because they do not explicitly
target the end users. However, most of them must be performed on a timely basis
and are associated with a deadline. We propose to schedule these flows by a centralized
controller, which determines when to transmit each flow and which path to use.
Two scheduling models are presented in this paper. In the first, the controller
also determines the rate of each flow, while in the second bandwidth is assigned
by the network according to the TCP rules. We develop scheduling algorithms for
both models and compare their complexity and performance.
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Polevoy G. Inter-Datacenter Scheduling of Large Data Flows. Cloud
Computing, IEEE Transactions on. 2015;PP(99):1-1. doi:10.1109/TCC.2015.2487964
apa: Cohen, R., & Polevoy, G. (2015). Inter-Datacenter Scheduling of Large Data
Flows. Cloud Computing, IEEE Transactions On, PP(99), 1–1. https://doi.org/10.1109/TCC.2015.2487964
bibtex: '@article{Cohen_Polevoy_2015, title={Inter-Datacenter Scheduling of Large
Data Flows}, volume={PP}, DOI={10.1109/TCC.2015.2487964},
number={99}, journal={Cloud Computing, IEEE Transactions on}, author={Cohen, R.
and Polevoy, Gleb}, year={2015}, pages={1–1} }'
chicago: 'Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data
Flows.” Cloud Computing, IEEE Transactions On PP, no. 99 (2015): 1–1. https://doi.org/10.1109/TCC.2015.2487964.'
ieee: R. Cohen and G. Polevoy, “Inter-Datacenter Scheduling of Large Data Flows,”
Cloud Computing, IEEE Transactions on, vol. PP, no. 99, pp. 1–1, 2015.
mla: Cohen, R., and Gleb Polevoy. “Inter-Datacenter Scheduling of Large Data Flows.”
Cloud Computing, IEEE Transactions On, vol. PP, no. 99, 2015, pp. 1–1,
doi:10.1109/TCC.2015.2487964.
short: R. Cohen, G. Polevoy, Cloud Computing, IEEE Transactions On PP (2015) 1–1.
date_created: 2020-08-06T15:20:58Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TCC.2015.2487964
extern: '1'
issue: '99'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Cloud computing
- Routing
- Schedules
- Scheduling
language:
- iso: eng
page: 1-1
publication: Cloud Computing, IEEE Transactions on
publication_identifier:
issn:
- 2168-7161
status: public
title: Inter-Datacenter Scheduling of Large Data Flows
type: journal_article
user_id: '83983'
volume: PP
year: '2015'
...
---
_id: '5678'
abstract:
- lang: eng
text: Many academic disciplines - including information systems, computer science,
and operations management - face scheduling problems as important decision making
tasks. Since many scheduling problems are NP-hard in the strong sense, there is
a need for developing solution heuristics. For scheduling problems with setup
times on unrelated parallel machines, there is limited research on solution methods
and to the best of our knowledge, parallel computer architectures have not yet
been taken advantage of. We address this gap by proposing and implementing a new
solution heuristic and by testing different parallelization strategies. In our
computational experiments, we show that our heuristic calculates near-optimal
solutions even for large instances and that computing time can be reduced substantially
by our parallelization approach.
author:
- first_name: Gerhard
full_name: Rauchecker, Gerhard
last_name: Rauchecker
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
citation:
ama: 'Rauchecker G, Schryen G. High-Performance Computing for Scheduling Decision
Support: A Parallel Depth-First Search Heuristic. In: Australasian Conference
on Information Systems. ; 2015:1-13.'
apa: 'Rauchecker, G., & Schryen, G. (2015). High-Performance Computing for Scheduling
Decision Support: A Parallel Depth-First Search Heuristic. In Australasian
Conference on Information Systems (pp. 1–13).'
bibtex: '@inproceedings{Rauchecker_Schryen_2015, title={High-Performance Computing
for Scheduling Decision Support: A Parallel Depth-First Search Heuristic}, booktitle={Australasian
Conference on Information Systems}, author={Rauchecker, Gerhard and Schryen, Guido},
year={2015}, pages={1–13} }'
chicago: 'Rauchecker, Gerhard, and Guido Schryen. “High-Performance Computing for
Scheduling Decision Support: A Parallel Depth-First Search Heuristic.” In Australasian
Conference on Information Systems, 1–13, 2015.'
ieee: 'G. Rauchecker and G. Schryen, “High-Performance Computing for Scheduling
Decision Support: A Parallel Depth-First Search Heuristic,” in Australasian
Conference on Information Systems, 2015, pp. 1–13.'
mla: 'Rauchecker, Gerhard, and Guido Schryen. “High-Performance Computing for Scheduling
Decision Support: A Parallel Depth-First Search Heuristic.” Australasian Conference
on Information Systems, 2015, pp. 1–13.'
short: 'G. Rauchecker, G. Schryen, in: Australasian Conference on Information Systems,
2015, pp. 1–13.'
date_created: 2018-11-14T15:39:50Z
date_updated: 2022-01-06T07:02:30Z
ddc:
- '000'
department:
- _id: '277'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: hsiemes
date_created: 2018-12-07T11:40:18Z
date_updated: 2018-12-13T15:08:28Z
file_id: '6031'
file_name: ACIS_2015_paper_7.pdf
file_size: 6771871
relation: main_file
file_date_updated: 2018-12-13T15:08:28Z
has_accepted_license: '1'
keyword:
- scheduling
- decision support
- heuristic
- high performance computing
- parallel algorithms
language:
- iso: eng
oa: '1'
page: 1-13
publication: Australasian Conference on Information Systems
status: public
title: 'High-Performance Computing for Scheduling Decision Support: A Parallel Depth-First
Search Heuristic'
type: conference
user_id: '61579'
year: '2015'
...
---
_id: '48838'
abstract:
- lang: eng
text: 'The majority of algorithms can be controlled or adjusted by parameters. Their
values can substantially affect the algorithms’ performance. Since the manual
exploration of the parameter space is tedious – even for few parameters – several
automatic procedures for parameter tuning have been proposed. Recent approaches
also take into account some characteristic properties of the problem instances,
frequently termed instance features. Our contribution is the proposal of a novel
concept for feature-based algorithm parameter tuning, which applies an approximating
surrogate model for learning the continuous feature-parameter mapping. To accomplish
this, we learn a joint model of the algorithm performance based on both the algorithm
parameters and the instance features. The required data is gathered using a recently
proposed acquisition function for model refinement in surrogate-based optimization:
the profile expected improvement. This function provides an avenue for maximizing
the information required for the feature-parameter mapping, i.e., the mapping
from instance features to the corresponding optimal algorithm parameters. The
approach is validated by applying the tuner to exemplary evolutionary algorithms
and problems, for which theoretically grounded or heuristically determined feature-parameter
mappings are available.'
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- first_name: Tobias
full_name: Wagner, Tobias
last_name: Wagner
- first_name: Günter
full_name: Rudolph, Günter
last_name: Rudolph
citation:
ama: 'Bossek J, Bischl B, Wagner T, Rudolph G. Learning Feature-Parameter Mappings
for Parameter Tuning via the Profile Expected Improvement. In: Proceedings
of the Genetic and Evolutionary Computation Conference. GECCO ’15. Association
for Computing Machinery; 2015:1319–1326. doi:10.1145/2739480.2754673'
apa: Bossek, J., Bischl, B., Wagner, T., & Rudolph, G. (2015). Learning Feature-Parameter
Mappings for Parameter Tuning via the Profile Expected Improvement. Proceedings
of the Genetic and Evolutionary Computation Conference, 1319–1326. https://doi.org/10.1145/2739480.2754673
bibtex: '@inproceedings{Bossek_Bischl_Wagner_Rudolph_2015, place={New York, NY,
USA}, series={GECCO ’15}, title={Learning Feature-Parameter Mappings for Parameter
Tuning via the Profile Expected Improvement}, DOI={10.1145/2739480.2754673},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Bischl,
Bernd and Wagner, Tobias and Rudolph, Günter}, year={2015}, pages={1319–1326},
collection={GECCO ’15} }'
chicago: 'Bossek, Jakob, Bernd Bischl, Tobias Wagner, and Günter Rudolph. “Learning
Feature-Parameter Mappings for Parameter Tuning via the Profile Expected Improvement.”
In Proceedings of the Genetic and Evolutionary Computation Conference,
1319–1326. GECCO ’15. New York, NY, USA: Association for Computing Machinery,
2015. https://doi.org/10.1145/2739480.2754673.'
ieee: 'J. Bossek, B. Bischl, T. Wagner, and G. Rudolph, “Learning Feature-Parameter
Mappings for Parameter Tuning via the Profile Expected Improvement,” in Proceedings
of the Genetic and Evolutionary Computation Conference, 2015, pp. 1319–1326,
doi: 10.1145/2739480.2754673.'
mla: Bossek, Jakob, et al. “Learning Feature-Parameter Mappings for Parameter Tuning
via the Profile Expected Improvement.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2015, pp. 1319–1326,
doi:10.1145/2739480.2754673.
short: 'J. Bossek, B. Bischl, T. Wagner, G. Rudolph, in: Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2015, pp. 1319–1326.'
date_created: 2023-11-14T15:58:51Z
date_updated: 2023-12-13T10:40:30Z
department:
- _id: '819'
doi: 10.1145/2739480.2754673
extern: '1'
keyword:
- evolutionary algorithms
- model-based optimization
- parameter tuning
language:
- iso: eng
page: 1319–1326
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-3472-3
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’15
status: public
title: Learning Feature-Parameter Mappings for Parameter Tuning via the Profile Expected
Improvement
type: conference
user_id: '102979'
year: '2015'
...
---
_id: '48887'
abstract:
- lang: eng
text: 'We evaluate the performance of a multi-objective evolutionary algorithm on
a class of dynamic routing problems with a single vehicle. In particular we focus
on relating algorithmic performance to the most prominent characteristics of problem
instances. The routing problem considers two types of customers: mandatory customers
must be visited whereas optional customers do not necessarily have to be visited.
Moreover, mandatory customers are known prior to the start of the tour whereas
optional customers request for service at later points in time with the vehicle
already being on its way. The multi-objective optimization problem then results
as maximizing the number of visited customers while simultaneously minimizing
total travel time. As an a-posteriori evaluation tool, the evolutionary algorithm
aims at approximating the related Pareto set for specifically designed benchmarking
instances differing in terms of number of customers, geographical layout, fraction
of mandatory customers, and request times of optional customers. Conceptional
and experimental comparisons to online heuristic procedures are provided.'
author:
- first_name: Stephan
full_name: Meisel, Stephan
last_name: Meisel
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Martin
full_name: Wölck, Martin
last_name: Wölck
- first_name: Günter
full_name: Rudolph, Günter
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Meisel S, Grimme C, Bossek J, Wölck M, Rudolph G, Trautmann H. Evaluation
of a Multi-Objective EA on Benchmark Instances for Dynamic Routing of a Vehicle.
In: Proceedings of the Genetic and Evolutionary Computation Conference .
GECCO’15. Association for Computing Machinery; 2015:425–432. doi:10.1145/2739480.2754705'
apa: Meisel, S., Grimme, C., Bossek, J., Wölck, M., Rudolph, G., & Trautmann,
H. (2015). Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic
Routing of a Vehicle. Proceedings of the Genetic and Evolutionary Computation
Conference , 425–432. https://doi.org/10.1145/2739480.2754705
bibtex: '@inproceedings{Meisel_Grimme_Bossek_Wölck_Rudolph_Trautmann_2015, place={New
York, NY, USA}, series={GECCO’15}, title={Evaluation of a Multi-Objective EA on
Benchmark Instances for Dynamic Routing of a Vehicle}, DOI={10.1145/2739480.2754705},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
}, publisher={Association for Computing Machinery}, author={Meisel, Stephan and
Grimme, Christian and Bossek, Jakob and Wölck, Martin and Rudolph, Günter and
Trautmann, Heike}, year={2015}, pages={425–432}, collection={GECCO’15} }'
chicago: 'Meisel, Stephan, Christian Grimme, Jakob Bossek, Martin Wölck, Günter
Rudolph, and Heike Trautmann. “Evaluation of a Multi-Objective EA on Benchmark
Instances for Dynamic Routing of a Vehicle.” In Proceedings of the Genetic
and Evolutionary Computation Conference , 425–432. GECCO’15. New York, NY,
USA: Association for Computing Machinery, 2015. https://doi.org/10.1145/2739480.2754705.'
ieee: 'S. Meisel, C. Grimme, J. Bossek, M. Wölck, G. Rudolph, and H. Trautmann,
“Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing
of a Vehicle,” in Proceedings of the Genetic and Evolutionary Computation Conference
, 2015, pp. 425–432, doi: 10.1145/2739480.2754705.'
mla: Meisel, Stephan, et al. “Evaluation of a Multi-Objective EA on Benchmark Instances
for Dynamic Routing of a Vehicle.” Proceedings of the Genetic and Evolutionary
Computation Conference , Association for Computing Machinery, 2015, pp. 425–432,
doi:10.1145/2739480.2754705.
short: 'S. Meisel, C. Grimme, J. Bossek, M. Wölck, G. Rudolph, H. Trautmann, in:
Proceedings of the Genetic and Evolutionary Computation Conference , Association
for Computing Machinery, New York, NY, USA, 2015, pp. 425–432.'
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:49:06Z
department:
- _id: '819'
doi: 10.1145/2739480.2754705
extern: '1'
keyword:
- combinatorial optimization
- metaheuristics
- multi-objective optimization
- online algorithms
- transportation
language:
- iso: eng
page: 425–432
place: New York, NY, USA
publication: 'Proceedings of the Genetic and Evolutionary Computation Conference '
publication_identifier:
isbn:
- 978-1-4503-3472-3
publisher: Association for Computing Machinery
series_title: GECCO’15
status: public
title: Evaluation of a Multi-Objective EA on Benchmark Instances for Dynamic Routing
of a Vehicle
type: conference
user_id: '102979'
year: '2015'
...
---
_id: '9889'
abstract:
- lang: eng
text: A measurement method is presented that combines the advantages of the multisine
measurement technique with a prediction method for peak bending behavior. This
combination allows the analysis of the dynamic behavior of mechanical structures
at distinctly reduced measurement durations and has the advantage of reducing
high excitation impacts on the structure under test.
author:
- first_name: Christian
full_name: Sprock, Christian
last_name: Sprock
- first_name: Walter
full_name: Sextro, Walter
id: '21220'
last_name: Sextro
citation:
ama: 'Sprock C, Sextro W. Time-efficient dynamic analysis of structures exhibiting
nonlinear peak bending. In: Instrumentation and Measurement Technology Conference
(I2MTC) Proceedings, 2014 IEEE International. ; 2014:320-324. doi:10.1109/I2MTC.2014.6860760'
apa: Sprock, C., & Sextro, W. (2014). Time-efficient dynamic analysis of structures
exhibiting nonlinear peak bending. In Instrumentation and Measurement Technology
Conference (I2MTC) Proceedings, 2014 IEEE International (pp. 320–324). https://doi.org/10.1109/I2MTC.2014.6860760
bibtex: '@inproceedings{Sprock_Sextro_2014, title={Time-efficient dynamic analysis
of structures exhibiting nonlinear peak bending}, DOI={10.1109/I2MTC.2014.6860760},
booktitle={Instrumentation and Measurement Technology Conference (I2MTC) Proceedings,
2014 IEEE International}, author={Sprock, Christian and Sextro, Walter}, year={2014},
pages={320–324} }'
chicago: Sprock, Christian, and Walter Sextro. “Time-Efficient Dynamic Analysis
of Structures Exhibiting Nonlinear Peak Bending.” In Instrumentation and Measurement
Technology Conference (I2MTC) Proceedings, 2014 IEEE International, 320–24,
2014. https://doi.org/10.1109/I2MTC.2014.6860760.
ieee: C. Sprock and W. Sextro, “Time-efficient dynamic analysis of structures exhibiting
nonlinear peak bending,” in Instrumentation and Measurement Technology Conference
(I2MTC) Proceedings, 2014 IEEE International, 2014, pp. 320–324.
mla: Sprock, Christian, and Walter Sextro. “Time-Efficient Dynamic Analysis of Structures
Exhibiting Nonlinear Peak Bending.” Instrumentation and Measurement Technology
Conference (I2MTC) Proceedings, 2014 IEEE International, 2014, pp. 320–24,
doi:10.1109/I2MTC.2014.6860760.
short: 'C. Sprock, W. Sextro, in: Instrumentation and Measurement Technology Conference
(I2MTC) Proceedings, 2014 IEEE International, 2014, pp. 320–324.'
date_created: 2019-05-20T13:25:22Z
date_updated: 2019-05-20T13:25:53Z
department:
- _id: '151'
doi: 10.1109/I2MTC.2014.6860760
keyword:
- bending
- dynamic testing
- measurement
- structural engineering
- vibrations
- measurement durations
- mechanical structures
- multisine measurement technique
- nonlinear peak bending behavior
- prediction method
- time-efficient dynamic analysis
- Heuristic algorithms
- Nonlinear systems
- Oscillators
- Time measurement
- Time-frequency analysis
- Vibrations
language:
- iso: eng
page: 320-324
publication: Instrumentation and Measurement Technology Conference (I2MTC) Proceedings,
2014 IEEE International
status: public
title: Time-efficient dynamic analysis of structures exhibiting nonlinear peak bending
type: conference
user_id: '55222'
year: '2014'
...
---
_id: '17663'
abstract:
- lang: eng
text: 'In this paper, we define and study a new problem, referred to as the Dependent
Unsplittable Flow Problem (D-UFP). We present and discuss this problem in the
context of large-scale powerful (radar/camera) sensor networks, but we believe
it has important applications on the admission of large flows in other networks
as well. In order to optimize the selection of flows transmitted to the gateway,
D-UFP takes into account possible dependencies between flows. We show that D-UFP
is more difficult than NP-hard problems for which no good approximation is known.
Then, we address two special cases of this problem: the case where all the sensors
have a shared channel and the case where the sensors form a mesh and route to
the gateway over a spanning tree.'
author:
- first_name: R.
full_name: Cohen, R.
last_name: Cohen
- first_name: I.
full_name: Nudelman, I.
last_name: Nudelman
- first_name: Gleb
full_name: Polevoy, Gleb
id: '83983'
last_name: Polevoy
citation:
ama: Cohen R, Nudelman I, Polevoy G. On the Admission of Dependent Flows in Powerful
Sensor Networks. Networking, IEEE/ACM Transactions on. 2013;21(5):1461-1471.
doi:10.1109/TNET.2012.2227792
apa: Cohen, R., Nudelman, I., & Polevoy, G. (2013). On the Admission of Dependent
Flows in Powerful Sensor Networks. Networking, IEEE/ACM Transactions On,
21(5), 1461–1471. https://doi.org/10.1109/TNET.2012.2227792
bibtex: '@article{Cohen_Nudelman_Polevoy_2013, title={On the Admission of Dependent
Flows in Powerful Sensor Networks}, volume={21}, DOI={10.1109/TNET.2012.2227792},
number={5}, journal={Networking, IEEE/ACM Transactions on}, author={Cohen, R.
and Nudelman, I. and Polevoy, Gleb}, year={2013}, pages={1461–1471} }'
chicago: 'Cohen, R., I. Nudelman, and Gleb Polevoy. “On the Admission of Dependent
Flows in Powerful Sensor Networks.” Networking, IEEE/ACM Transactions On
21, no. 5 (2013): 1461–71. https://doi.org/10.1109/TNET.2012.2227792.'
ieee: R. Cohen, I. Nudelman, and G. Polevoy, “On the Admission of Dependent Flows
in Powerful Sensor Networks,” Networking, IEEE/ACM Transactions on, vol.
21, no. 5, pp. 1461–1471, 2013.
mla: Cohen, R., et al. “On the Admission of Dependent Flows in Powerful Sensor Networks.”
Networking, IEEE/ACM Transactions On, vol. 21, no. 5, 2013, pp. 1461–71,
doi:10.1109/TNET.2012.2227792.
short: R. Cohen, I. Nudelman, G. Polevoy, Networking, IEEE/ACM Transactions On 21
(2013) 1461–1471.
date_created: 2020-08-06T15:22:05Z
date_updated: 2022-01-06T06:53:16Z
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2012.2227792
extern: '1'
intvolume: ' 21'
issue: '5'
keyword:
- Approximation algorithms
- Approximation methods
- Bandwidth
- Logic gates
- Radar
- Vectors
- Wireless sensor networks
- Dependent flow scheduling
- sensor networks
language:
- iso: eng
page: 1461-1471
publication: Networking, IEEE/ACM Transactions on
publication_identifier:
issn:
- 1063-6692
status: public
title: On the Admission of Dependent Flows in Powerful Sensor Networks
type: journal_article
user_id: '83983'
volume: 21
year: '2013'
...
---
_id: '46388'
abstract:
- lang: eng
text: Understanding the behaviour of well-known algorithms for classical NP-hard
optimisation problems is still a difficult task. With this paper, we contribute
to this research direction and carry out a feature based comparison of local search
and the well-known Christofides approximation algorithm for the Traveling Salesperson
Problem. We use an evolutionary algorithm approach to construct easy and hard
instances for the Christofides algorithm, where we measure hardness in terms of
approximation ratio. Our results point out important features and lead to hard
and easy instances for this famous algorithm. Furthermore, our cross-comparison
gives new insights on the complementary benefits of the different approaches.
author:
- first_name: Samadhi
full_name: Nallaperuma, Samadhi
last_name: Nallaperuma
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Nallaperuma S, Wagner M, Neumann F, Bischl B, Mersmann O, Trautmann H. A Feature-Based
Comparison of Local Search and the Christofides Algorithm for the Travelling Salesperson
Problem. In: Proceedings of the Twelfth Workshop on Foundations of Genetic
Algorithms XII. FOGA XII ’13. Association for Computing Machinery; 2013:147–160.
doi:10.1145/2460239.2460253'
apa: Nallaperuma, S., Wagner, M., Neumann, F., Bischl, B., Mersmann, O., & Trautmann,
H. (2013). A Feature-Based Comparison of Local Search and the Christofides Algorithm
for the Travelling Salesperson Problem. Proceedings of the Twelfth Workshop
on Foundations of Genetic Algorithms XII, 147–160. https://doi.org/10.1145/2460239.2460253
bibtex: '@inproceedings{Nallaperuma_Wagner_Neumann_Bischl_Mersmann_Trautmann_2013,
place={New York, NY, USA}, series={FOGA XII ’13}, title={A Feature-Based Comparison
of Local Search and the Christofides Algorithm for the Travelling Salesperson
Problem}, DOI={10.1145/2460239.2460253},
booktitle={Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms
XII}, publisher={Association for Computing Machinery}, author={Nallaperuma, Samadhi
and Wagner, Markus and Neumann, Frank and Bischl, Bernd and Mersmann, Olaf and
Trautmann, Heike}, year={2013}, pages={147–160}, collection={FOGA XII ’13} }'
chicago: 'Nallaperuma, Samadhi, Markus Wagner, Frank Neumann, Bernd Bischl, Olaf
Mersmann, and Heike Trautmann. “A Feature-Based Comparison of Local Search and
the Christofides Algorithm for the Travelling Salesperson Problem.” In Proceedings
of the Twelfth Workshop on Foundations of Genetic Algorithms XII, 147–160.
FOGA XII ’13. New York, NY, USA: Association for Computing Machinery, 2013. https://doi.org/10.1145/2460239.2460253.'
ieee: 'S. Nallaperuma, M. Wagner, F. Neumann, B. Bischl, O. Mersmann, and H. Trautmann,
“A Feature-Based Comparison of Local Search and the Christofides Algorithm for
the Travelling Salesperson Problem,” in Proceedings of the Twelfth Workshop
on Foundations of Genetic Algorithms XII, 2013, pp. 147–160, doi: 10.1145/2460239.2460253.'
mla: Nallaperuma, Samadhi, et al. “A Feature-Based Comparison of Local Search and
the Christofides Algorithm for the Travelling Salesperson Problem.” Proceedings
of the Twelfth Workshop on Foundations of Genetic Algorithms XII, Association
for Computing Machinery, 2013, pp. 147–160, doi:10.1145/2460239.2460253.
short: 'S. Nallaperuma, M. Wagner, F. Neumann, B. Bischl, O. Mersmann, H. Trautmann,
in: Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms XII,
Association for Computing Machinery, New York, NY, USA, 2013, pp. 147–160.'
date_created: 2023-08-04T15:42:03Z
date_updated: 2023-10-16T13:45:53Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2460239.2460253
keyword:
- approximation algorithms
- local search
- traveling salesperson problem
- feature selection
- prediction
- classification
language:
- iso: eng
page: 147–160
place: New York, NY, USA
publication: Proceedings of the Twelfth Workshop on Foundations of Genetic Algorithms
XII
publication_identifier:
isbn:
- '9781450319904'
publisher: Association for Computing Machinery
series_title: FOGA XII ’13
status: public
title: A Feature-Based Comparison of Local Search and the Christofides Algorithm for
the Travelling Salesperson Problem
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '37006'
abstract:
- lang: eng
text: In this paper we present an approach for the configuration and reconfiguration
of FlexRay networks to increase their fault tolerance. To guarantee a correct
and deterministic system behavior, the FlexRay specification does not allow a
reconfiguration of the schedapproachule during run time. To avoid the necessity
of a complete bus restart in case of a node failure, we propose a reconfiguration
using redundant slots in the schedule and/or combine messages in existing frames
and slots, to compensate node failures and increase robustness. Our approach supports
the developer to increase the fault tolerance of the system during the design
phase. It is a heuristic, which, additionally to a determined initial configuration,
calculates possible reconfigurations for the remaining nodes of the FlexRay network
in case of a node failure, to keep the system working properly. An evaluation
by means of realistic safety-critical automotive real-time systems revealed that
it determines valid reconfigurations for up to 80% of possible individual node
failures. In summary, our approach offers major support for the developer of FlexRay
networks since the results provide helpful feedback about reconfiguration capabilities.
In an iterative design process these information can be used to determine and
optimize valid reconfigurations.
author:
- first_name: Kay
full_name: Klobedanz, Kay
last_name: Klobedanz
- first_name: Andreas
full_name: König, Andreas
last_name: König
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Klobedanz K, König A, Müller W. A Reconfiguration Approach for Faul-Tolerant
FlexRay Networks. In: Proceedings of DATE’11. IEEE; 2011. doi:10.1109/DATE.2011.5763022'
apa: Klobedanz, K., König, A., & Müller, W. (2011). A Reconfiguration Approach
for Faul-Tolerant FlexRay Networks. Proceedings of DATE’11. 2011 Design,
Automation & Test in Europe, Grenoble, France. https://doi.org/10.1109/DATE.2011.5763022
bibtex: '@inproceedings{Klobedanz_König_Müller_2011, place={Grenoble, France}, title={A
Reconfiguration Approach for Faul-Tolerant FlexRay Networks}, DOI={10.1109/DATE.2011.5763022},
booktitle={Proceedings of DATE’11}, publisher={IEEE}, author={Klobedanz, Kay and
König, Andreas and Müller, Wolfgang}, year={2011} }'
chicago: 'Klobedanz, Kay, Andreas König, and Wolfgang Müller. “A Reconfiguration
Approach for Faul-Tolerant FlexRay Networks.” In Proceedings of DATE’11.
Grenoble, France: IEEE, 2011. https://doi.org/10.1109/DATE.2011.5763022.'
ieee: 'K. Klobedanz, A. König, and W. Müller, “A Reconfiguration Approach for Faul-Tolerant
FlexRay Networks,” presented at the 2011 Design, Automation & Test in Europe,
Grenoble, France, 2011, doi: 10.1109/DATE.2011.5763022.'
mla: Klobedanz, Kay, et al. “A Reconfiguration Approach for Faul-Tolerant FlexRay
Networks.” Proceedings of DATE’11, IEEE, 2011, doi:10.1109/DATE.2011.5763022.
short: 'K. Klobedanz, A. König, W. Müller, in: Proceedings of DATE’11, IEEE, Grenoble,
France, 2011.'
conference:
location: Grenoble, France
name: 2011 Design, Automation & Test in Europe
date_created: 2023-01-17T09:09:25Z
date_updated: 2023-01-17T09:09:33Z
department:
- _id: '672'
doi: 10.1109/DATE.2011.5763022
keyword:
- Schedules
- Fault tolerant systems
- Redundancy
- Protocols
- Automotive engineering
- Genetic algorithms
language:
- iso: eng
place: Grenoble, France
publication: Proceedings of DATE'11
publisher: IEEE
status: public
title: A Reconfiguration Approach for Faul-Tolerant FlexRay Networks
type: conference
user_id: '5786'
year: '2011'
...
---
_id: '5685'
abstract:
- lang: eng
text: In double-sided markets for computing resources an optimal allocation schedule
among job offers and requests subject to relevant capacity constraints can be
determined. With increasing storage demands and emerging storage services the
question how to schedule storage jobs becomes more and more interesting. Since
such scheduling problems are often in the class NP-complete an exact computation
is not feasible in practice. On the other hand an approximation to the optimal
solution can easily be found by means of using heuristics. The problem with this
attempt is that the suggested solution may not be exactly optimal and is thus
less satisfying. Considering the two above mentioned solution approaches one can
clearly find a trade-off between the optimality of the solution and the efficiency
to get to a solution at all. This work proposes to apply and combine heuristics
in optimization to gain from both of their benefits while reducing the problematic
aspects. Following this method it is assumed to get closer to the optimal solution
in a shorter time compared to a full optimization.
author:
- first_name: Josef
full_name: Finkbeiner, Josef
last_name: Finkbeiner
- first_name: Christian
full_name: Bodenstein, Christian
last_name: Bodenstein
- first_name: Guido
full_name: Schryen, Guido
id: '72850'
last_name: Schryen
- first_name: Dirk
full_name: Neumann, Dirk
last_name: Neumann
citation:
ama: 'Finkbeiner J, Bodenstein C, Schryen G, Neumann D. Applying heuristic methods
for job scheduling in storage markets. In: 18th European Conference on Information
Systems (ECIS 2010). ; 2010.'
apa: Finkbeiner, J., Bodenstein, C., Schryen, G., & Neumann, D. (2010). Applying
heuristic methods for job scheduling in storage markets. In 18th European Conference
on Information Systems (ECIS 2010).
bibtex: '@inproceedings{Finkbeiner_Bodenstein_Schryen_Neumann_2010, title={Applying
heuristic methods for job scheduling in storage markets}, booktitle={18th European
Conference on Information Systems (ECIS 2010)}, author={Finkbeiner, Josef and
Bodenstein, Christian and Schryen, Guido and Neumann, Dirk}, year={2010} }'
chicago: Finkbeiner, Josef, Christian Bodenstein, Guido Schryen, and Dirk Neumann.
“Applying Heuristic Methods for Job Scheduling in Storage Markets.” In 18th
European Conference on Information Systems (ECIS 2010), 2010.
ieee: J. Finkbeiner, C. Bodenstein, G. Schryen, and D. Neumann, “Applying heuristic
methods for job scheduling in storage markets,” in 18th European Conference
on Information Systems (ECIS 2010), 2010.
mla: Finkbeiner, Josef, et al. “Applying Heuristic Methods for Job Scheduling in
Storage Markets.” 18th European Conference on Information Systems (ECIS 2010),
2010.
short: 'J. Finkbeiner, C. Bodenstein, G. Schryen, D. Neumann, in: 18th European
Conference on Information Systems (ECIS 2010), 2010.'
date_created: 2018-11-14T15:45:11Z
date_updated: 2022-01-06T07:02:32Z
ddc:
- '000'
department:
- _id: '277'
extern: '1'
file:
- access_level: open_access
content_type: application/pdf
creator: hsiemes
date_created: 2018-12-11T15:21:06Z
date_updated: 2018-12-13T15:19:40Z
file_id: '6188'
file_name: s1-ln7055316-1881058806-1939656818Hwf-1884822883IdV-5442784107055316PDF_HI0001.pdf
file_size: 171336
relation: main_file
file_date_updated: 2018-12-13T15:19:40Z
has_accepted_license: '1'
keyword:
- Decision Support System
- Algorithms
- Optimization
- Market Engineering
language:
- iso: eng
oa: '1'
publication: 18th European Conference on Information Systems (ECIS 2010)
status: public
title: Applying heuristic methods for job scheduling in storage markets
type: conference
user_id: '61579'
year: '2010'
...
---
_id: '64055'
abstract:
- lang: eng
text: A program for iterative fitting procedures to determine the NMR parameters
from 51V solid-state MAS NMR spectra was developed. It contains options to use
genetic algorithms and downhill-simplex optimizing procedures to extract the optimal
parameter sets, which describe our spectra. As computational kernel the SIMPSON
program is employed. Other kernels like SPINEVOLUTION are easily incorporable.
The algorithms are checked for their suitability for the present optimization
problem and optimal simulation conditions are determined, with the focus on minimal
processing time. The procedure leads to a very good agreement between experimental
and simulated spectra in a passable period of time. First results for spectra
of model compounds for the active site of vanadium haloperoxidases are presented.
author:
- first_name: Maria
full_name: Waechtler, Maria
last_name: Waechtler
- first_name: Annika
full_name: Schweitzer, Annika
last_name: Schweitzer
- first_name: Torsten
full_name: Gutmann, Torsten
id: '118165'
last_name: Gutmann
- first_name: Hergen
full_name: Breitzke, Hergen
last_name: Breitzke
- first_name: Gerd
full_name: Buntkowsky, Gerd
last_name: Buntkowsky
citation:
ama: Waechtler M, Schweitzer A, Gutmann T, Breitzke H, Buntkowsky G. Efficient analysis
of 51V solid-state MAS NMR spectra using genetic algorithms. Solid State Nuclear
Magnetic Resonance. 2009;35(1):37–48. doi:10.1016/j.ssnmr.2008.11.003
apa: Waechtler, M., Schweitzer, A., Gutmann, T., Breitzke, H., & Buntkowsky,
G. (2009). Efficient analysis of 51V solid-state MAS NMR spectra using genetic
algorithms. Solid State Nuclear Magnetic Resonance, 35(1), 37–48.
https://doi.org/10.1016/j.ssnmr.2008.11.003
bibtex: '@article{Waechtler_Schweitzer_Gutmann_Breitzke_Buntkowsky_2009, title={Efficient
analysis of 51V solid-state MAS NMR spectra using genetic algorithms}, volume={35},
DOI={10.1016/j.ssnmr.2008.11.003},
number={1}, journal={Solid State Nuclear Magnetic Resonance}, author={Waechtler,
Maria and Schweitzer, Annika and Gutmann, Torsten and Breitzke, Hergen and Buntkowsky,
Gerd}, year={2009}, pages={37–48} }'
chicago: 'Waechtler, Maria, Annika Schweitzer, Torsten Gutmann, Hergen Breitzke,
and Gerd Buntkowsky. “Efficient Analysis of 51V Solid-State MAS NMR Spectra Using
Genetic Algorithms.” Solid State Nuclear Magnetic Resonance 35, no. 1 (2009):
37–48. https://doi.org/10.1016/j.ssnmr.2008.11.003.'
ieee: 'M. Waechtler, A. Schweitzer, T. Gutmann, H. Breitzke, and G. Buntkowsky,
“Efficient analysis of 51V solid-state MAS NMR spectra using genetic algorithms,”
Solid State Nuclear Magnetic Resonance, vol. 35, no. 1, pp. 37–48, 2009,
doi: 10.1016/j.ssnmr.2008.11.003.'
mla: Waechtler, Maria, et al. “Efficient Analysis of 51V Solid-State MAS NMR Spectra
Using Genetic Algorithms.” Solid State Nuclear Magnetic Resonance, vol.
35, no. 1, 2009, pp. 37–48, doi:10.1016/j.ssnmr.2008.11.003.
short: M. Waechtler, A. Schweitzer, T. Gutmann, H. Breitzke, G. Buntkowsky, Solid
State Nuclear Magnetic Resonance 35 (2009) 37–48.
date_created: 2026-02-07T16:15:57Z
date_updated: 2026-02-17T16:12:50Z
doi: 10.1016/j.ssnmr.2008.11.003
extern: '1'
intvolume: ' 35'
issue: '1'
keyword:
- 51V MAS NMR spectroscopy
- Genetic algorithms
- Iterative fitting procedures
- Model complexes for vanadium haloperoxidases
language:
- iso: eng
page: 37–48
publication: Solid State Nuclear Magnetic Resonance
status: public
title: Efficient analysis of 51V solid-state MAS NMR spectra using genetic algorithms
type: journal_article
user_id: '100715'
volume: 35
year: '2009'
...
---
_id: '6508'
abstract:
- lang: eng
text: 'In this paper, we present a framework that supports experimenting with evolutionary
hardware design. We describe the framework''s modules for composing evolutionary
optimizers and for setting up, controlling, and analyzing experiments. Two case
studies demonstrate the usefulness of the framework: evolution of hash functions
and evolution based on pre-engineered circuits.'
author:
- first_name: Paul
full_name: Kaufmann, Paul
last_name: Kaufmann
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Kaufmann P, Platzner M. MOVES: A Modular Framework for Hardware Evolution.
In: Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007).
IEEE; 2007:447-454. doi:10.1109/ahs.2007.73'
apa: 'Kaufmann, P., & Platzner, M. (2007). MOVES: A Modular Framework for Hardware
Evolution. In Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS
2007) (pp. 447–454). Edinburgh, UK: IEEE. https://doi.org/10.1109/ahs.2007.73'
bibtex: '@inproceedings{Kaufmann_Platzner_2007, title={MOVES: A Modular Framework
for Hardware Evolution}, DOI={10.1109/ahs.2007.73},
booktitle={Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)},
publisher={IEEE}, author={Kaufmann, Paul and Platzner, Marco}, year={2007}, pages={447–454}
}'
chicago: 'Kaufmann, Paul, and Marco Platzner. “MOVES: A Modular Framework for Hardware
Evolution.” In Second NASA/ESA Conference on Adaptive Hardware and Systems
(AHS 2007), 447–54. IEEE, 2007. https://doi.org/10.1109/ahs.2007.73.'
ieee: 'P. Kaufmann and M. Platzner, “MOVES: A Modular Framework for Hardware Evolution,”
in Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007),
Edinburgh, UK, 2007, pp. 447–454.'
mla: 'Kaufmann, Paul, and Marco Platzner. “MOVES: A Modular Framework for Hardware
Evolution.” Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS
2007), IEEE, 2007, pp. 447–54, doi:10.1109/ahs.2007.73.'
short: 'P. Kaufmann, M. Platzner, in: Second NASA/ESA Conference on Adaptive Hardware
and Systems (AHS 2007), IEEE, 2007, pp. 447–454.'
conference:
end_date: 2007-08-08
location: Edinburgh, UK
name: Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)
start_date: 2007-08-05
date_created: 2019-01-08T09:52:43Z
date_updated: 2022-01-06T07:03:08Z
department:
- _id: '78'
doi: 10.1109/ahs.2007.73
keyword:
- integrated circuit design
- hardware evolution
- evolutionary hardware design
- evolutionary optimizers
- hash functions
- preengineered circuits
- Hardware
- Circuits
- Design optimization
- Visualization
- Genetic programming
- Genetic mutations
- Clustering algorithms
- Biological cells
- Field programmable gate arrays
- Routing
language:
- iso: eng
page: 447-454
publication: Second NASA/ESA Conference on Adaptive Hardware and Systems (AHS 2007)
publication_identifier:
isbn:
- 076952866X
- '9780769528663'
publication_status: published
publisher: IEEE
status: public
title: 'MOVES: A Modular Framework for Hardware Evolution'
type: conference
user_id: '3118'
year: '2007'
...
---
_id: '11930'
abstract:
- lang: eng
text: For human-machine interfaces in distant-talking environments multichannel
signal processing is often employed to obtain an enhanced signal for subsequent
processing. In this paper we propose a novel adaptation algorithm for a filter-and-sum
beamformer to adjust the coefficients of FIR filters to changing acoustic room
impulses, e.g. due to speaker movement. A deterministic and a stochastic gradient
ascent algorithm are derived from a constrained optimization problem, which iteratively
estimates the eigenvector corresponding to the largest eigenvalue of the cross
power spectral density of the microphone signals. The method does not require
an explicit estimation of the speaker location. The experimental results show
fast adaptation and excellent robustness of the proposed algorithm.
author:
- first_name: Ernst
full_name: Warsitz, Ernst
last_name: Warsitz
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
citation:
ama: 'Warsitz E, Haeb-Umbach R. Acoustic filter-and-sum beamforming by adaptive
principal component analysis. In: IEEE International Conference on Acoustics,
Speech and Signal Processing (ICASSP 2005). Vol 4. ; 2005:iv/797-iv/800 Vol.
4. doi:10.1109/ICASSP.2005.1416129'
apa: Warsitz, E., & Haeb-Umbach, R. (2005). Acoustic filter-and-sum beamforming
by adaptive principal component analysis. In IEEE International Conference
on Acoustics, Speech and Signal Processing (ICASSP 2005) (Vol. 4, p. iv/797-iv/800
Vol. 4). https://doi.org/10.1109/ICASSP.2005.1416129
bibtex: '@inproceedings{Warsitz_Haeb-Umbach_2005, title={Acoustic filter-and-sum
beamforming by adaptive principal component analysis}, volume={4}, DOI={10.1109/ICASSP.2005.1416129},
booktitle={IEEE International Conference on Acoustics, Speech and Signal Processing
(ICASSP 2005)}, author={Warsitz, Ernst and Haeb-Umbach, Reinhold}, year={2005},
pages={iv/797-iv/800 Vol. 4} }'
chicago: Warsitz, Ernst, and Reinhold Haeb-Umbach. “Acoustic Filter-and-Sum Beamforming
by Adaptive Principal Component Analysis.” In IEEE International Conference
on Acoustics, Speech and Signal Processing (ICASSP 2005), 4:iv/797-iv/800
Vol. 4, 2005. https://doi.org/10.1109/ICASSP.2005.1416129.
ieee: E. Warsitz and R. Haeb-Umbach, “Acoustic filter-and-sum beamforming by adaptive
principal component analysis,” in IEEE International Conference on Acoustics,
Speech and Signal Processing (ICASSP 2005), 2005, vol. 4, p. iv/797-iv/800
Vol. 4.
mla: Warsitz, Ernst, and Reinhold Haeb-Umbach. “Acoustic Filter-and-Sum Beamforming
by Adaptive Principal Component Analysis.” IEEE International Conference on
Acoustics, Speech and Signal Processing (ICASSP 2005), vol. 4, 2005, p. iv/797-iv/800
Vol. 4, doi:10.1109/ICASSP.2005.1416129.
short: 'E. Warsitz, R. Haeb-Umbach, in: IEEE International Conference on Acoustics,
Speech and Signal Processing (ICASSP 2005), 2005, p. iv/797-iv/800 Vol. 4.'
date_created: 2019-07-12T05:31:00Z
date_updated: 2022-01-06T06:51:12Z
department:
- _id: '54'
doi: 10.1109/ICASSP.2005.1416129
intvolume: ' 4'
keyword:
- acoustic filter-and-sum beamforming
- acoustic room impulses
- acoustic signal processing
- adaptive principal component analysis
- adaptive signal processing
- architectural acoustics
- constrained optimization problem
- cross power spectral density
- deterministic algorithm
- deterministic algorithms
- distant-talking environments
- eigenvalues and eigenfunctions
- eigenvector
- enhanced signal
- filter-and-sum beamformer
- FIR filter coefficients
- FIR filter coefficients
- FIR filters
- gradient methods
- human-machine interfaces
- iterative estimation
- iterative methods
- largest eigenvalue
- microphone signals
- multichannel signal processing
- optimisation
- principal component analysis
- spectral analysis
- stochastic gradient ascent algorithm
- stochastic processes
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://groups.uni-paderborn.de/nt/pubs/2005/WaHa05.pdf
oa: '1'
page: iv/797-iv/800 Vol. 4
publication: IEEE International Conference on Acoustics, Speech and Signal Processing
(ICASSP 2005)
status: public
title: Acoustic filter-and-sum beamforming by adaptive principal component analysis
type: conference
user_id: '44006'
volume: 4
year: '2005'
...