---
_id: '46347'
abstract:
- lang: eng
text: We continue recent work on the definition of multimodality in multiobjective
optimization (MO) and the introduction of a test bed for multimodal MO problems.
This goes beyond well-known diversity maintenance approaches but instead focuses
on the landscape topology induced by the objective functions. More general multimodal
MO problems are considered by allowing ellipsoid contours for single-objective
subproblems. An experimental analysis compares two MO algorithms, one that explicitly
relies on hypervolume gradient approximation, and one that is based on local search,
both on a selection of generated example problems. We do not focus on performance
but on the interaction induced by the problems and algorithms, which can be described
by means of specific characteristics explicitly designed for the multimodal MO
setting. Furthermore, we widen the scope of our analysis by additionally applying
visualization techniques in the decision space. This strengthens and extends the
foundations for Exploratory Landscape Analysis (ELA) in MO.
author:
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Hao
full_name: Wang, Hao
last_name: Wang
- first_name: Mike
full_name: Preuss, Mike
last_name: Preuss
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: André
full_name: Deutz, André
last_name: Deutz
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Michael
full_name: Emmerich, Michael
last_name: Emmerich
citation:
ama: Kerschke P, Wang H, Preuss M, et al. Search Dynamics on Multimodal Multi-Objective
Problems. Evolutionary Computation (ECJ). 2019;27(4):577–609. doi:10.1162/evco_a_00234
apa: Kerschke, P., Wang, H., Preuss, M., Grimme, C., Deutz, A., Trautmann, H., &
Emmerich, M. (2019). Search Dynamics on Multimodal Multi-Objective Problems. Evolutionary
Computation (ECJ), 27(4), 577–609. https://doi.org/10.1162/evco_a_00234
bibtex: '@article{Kerschke_Wang_Preuss_Grimme_Deutz_Trautmann_Emmerich_2019, title={Search
Dynamics on Multimodal Multi-Objective Problems}, volume={27}, DOI={10.1162/evco_a_00234},
number={4}, journal={Evolutionary Computation (ECJ)}, author={Kerschke, Pascal
and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann,
Heike and Emmerich, Michael}, year={2019}, pages={577–609} }'
chicago: 'Kerschke, Pascal, Hao Wang, Mike Preuss, Christian Grimme, André Deutz,
Heike Trautmann, and Michael Emmerich. “Search Dynamics on Multimodal Multi-Objective
Problems.” Evolutionary Computation (ECJ) 27, no. 4 (2019): 577–609. https://doi.org/10.1162/evco_a_00234.'
ieee: 'P. Kerschke et al., “Search Dynamics on Multimodal Multi-Objective
Problems,” Evolutionary Computation (ECJ), vol. 27, no. 4, pp. 577–609,
2019, doi: 10.1162/evco_a_00234.'
mla: Kerschke, Pascal, et al. “Search Dynamics on Multimodal Multi-Objective Problems.”
Evolutionary Computation (ECJ), vol. 27, no. 4, 2019, pp. 577–609, doi:10.1162/evco_a_00234.
short: P. Kerschke, H. Wang, M. Preuss, C. Grimme, A. Deutz, H. Trautmann, M. Emmerich,
Evolutionary Computation (ECJ) 27 (2019) 577–609.
date_created: 2023-08-04T07:52:06Z
date_updated: 2023-10-16T13:32:18Z
department:
- _id: '34'
- _id: '819'
doi: 10.1162/evco_a_00234
intvolume: ' 27'
issue: '4'
language:
- iso: eng
page: 577–609
publication: Evolutionary Computation (ECJ)
status: public
title: Search Dynamics on Multimodal Multi-Objective Problems
type: journal_article
user_id: '15504'
volume: 27
year: '2019'
...
---
_id: '48841'
abstract:
- lang: eng
text: We tackle a bi-objective dynamic orienteering problem where customer requests
arise as time passes by. The goal is to minimize the tour length traveled by a
single delivery vehicle while simultaneously keeping the number of dismissed dynamic
customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm
which is grounded on insights gained from a previous series of work on an a-posteriori
version of the problem, where all request times are known in advance. In our experiments,
we simulate different decision maker strategies and evaluate the development of
the Pareto-front approximations on exemplary problem instances. It turns out,
that despite severely reduced computational budget and no oracle-knowledge of
request times the dynamic EMOA is capable of producing approximations which partially
dominate the results of the a-posteriori EMOA and dynamic integer linear programming
strategies.
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: Stephan
full_name: Meisel, Stephan
last_name: Meisel
- first_name: Günter
full_name: Rudolph, Günter
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Bi-Objective Orienteering:
Towards a Dynamic Multi-objective Evolutionary Algorithm. In: Deb K, Goodman E,
Coello Coello CA, et al., eds. Evolutionary Multi-Criterion Optimization (EMO).
Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528.
doi:10.1007/978-3-030-12598-1_41'
apa: 'Bossek, J., Grimme, C., Meisel, S., Rudolph, G., & Trautmann, H. (2019).
Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm.
In K. Deb, E. Goodman, C. A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim,
& P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO) (pp.
516–528). Springer International Publishing. https://doi.org/10.1007/978-3-030-12598-1_41'
bibtex: '@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2019, place={Cham},
series={Lecture Notes in Computer Science}, title={Bi-Objective Orienteering:
Towards a Dynamic Multi-objective Evolutionary Algorithm}, DOI={10.1007/978-3-030-12598-1_41},
booktitle={Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer
International Publishing}, author={Bossek, Jakob and Grimme, Christian and Meisel,
Stephan and Rudolph, Günter and Trautmann, Heike}, editor={Deb, Kalyanmoy and
Goodman, Erik and Coello Coello, Carlos A. and Klamroth, Kathrin and Miettinen,
Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={516–528}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike
Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary
Algorithm.” In Evolutionary Multi-Criterion Optimization (EMO), edited
by Kalyanmoy Deb, Erik Goodman, Carlos A. Coello Coello, Kathrin Klamroth, Kaisa
Miettinen, Sanaz Mostaghim, and Patrick Reed, 516–528. Lecture Notes in Computer
Science. Cham: Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-12598-1_41.'
ieee: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective
Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm,” in Evolutionary
Multi-Criterion Optimization (EMO), 2019, pp. 516–528, doi: 10.1007/978-3-030-12598-1_41.'
mla: 'Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective
Evolutionary Algorithm.” Evolutionary Multi-Criterion Optimization (EMO),
edited by Kalyanmoy Deb et al., Springer International Publishing, 2019, pp. 516–528,
doi:10.1007/978-3-030-12598-1_41.'
short: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: K. Deb, E.
Goodman, C.A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed
(Eds.), Evolutionary Multi-Criterion Optimization (EMO), Springer International
Publishing, Cham, 2019, pp. 516–528.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:43:07Z
department:
- _id: '819'
doi: 10.1007/978-3-030-12598-1_41
editor:
- first_name: Kalyanmoy
full_name: Deb, Kalyanmoy
last_name: Deb
- first_name: Erik
full_name: Goodman, Erik
last_name: Goodman
- first_name: Carlos A.
full_name: Coello Coello, Carlos A.
last_name: Coello Coello
- first_name: Kathrin
full_name: Klamroth, Kathrin
last_name: Klamroth
- first_name: Kaisa
full_name: Miettinen, Kaisa
last_name: Miettinen
- first_name: Sanaz
full_name: Mostaghim, Sanaz
last_name: Mostaghim
- first_name: Patrick
full_name: Reed, Patrick
last_name: Reed
extern: '1'
keyword:
- Combinatorial optimization
- Dynamic optimization
- Metaheuristics
- Multi-objective optimization
- Vehicle routing
language:
- iso: eng
page: 516–528
place: Cham
publication: Evolutionary Multi-Criterion Optimization (EMO)
publication_identifier:
isbn:
- 978-3-030-12598-1
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary
Algorithm'
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48842'
abstract:
- lang: eng
text: 'Evolutionary algorithms have successfully been applied to evolve problem
instances that exhibit a significant difference in performance for a given algorithm
or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP).
Creating a large variety of instances is crucial for successful applications in
the blooming field of algorithm selection. In this paper, we introduce new and
creative mutation operators for evolving instances of the TSP. We show that adopting
those operators in an evolutionary algorithm allows for the generation of benchmark
sets with highly desirable properties: (1) novelty by clear visual distinction
to established benchmark sets in the field, (2) visual and quantitative diversity
in the space of TSP problem characteristics, and (3) significant performance differences
with respect to the restart versions of heuristic state-of-the-art TSP solvers
EAX and LKH. The important aspect of diversity is addressed and achieved solely
by the proposed mutation operators and not enforced by explicit diversity preservation.'
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving
Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: Proceedings
of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. FOGA
’19. Association for Computing Machinery; 2019:58–71. doi:10.1145/3299904.3340307'
apa: Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., & Trautmann,
H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation
Operators. Proceedings of the 15th ACM/SIGEVO Conference on Foundations of
Genetic Algorithms, 58–71. https://doi.org/10.1145/3299904.3340307
bibtex: '@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={New
York, NY, USA}, series={FOGA ’19}, title={Evolving Diverse TSP Instances by Means
of Novel and Creative Mutation Operators}, DOI={10.1145/3299904.3340307},
booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms}, publisher={Association for Computing Machinery}, author={Bossek,
Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann,
Frank and Trautmann, Heike}, year={2019}, pages={58–71}, collection={FOGA ’19}
}'
chicago: 'Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann,
and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative
Mutation Operators.” In Proceedings of the 15th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, 58–71. FOGA ’19. New York, NY, USA: Association for
Computing Machinery, 2019. https://doi.org/10.1145/3299904.3340307.'
ieee: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann,
“Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,”
in Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms, 2019, pp. 58–71, doi: 10.1145/3299904.3340307.'
mla: Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and
Creative Mutation Operators.” Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, Association for Computing Machinery,
2019, pp. 58–71, doi:10.1145/3299904.3340307.
short: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann,
in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms,
Association for Computing Machinery, New York, NY, USA, 2019, pp. 58–71.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:42:57Z
department:
- _id: '819'
doi: 10.1145/3299904.3340307
extern: '1'
keyword:
- benchmarking
- instance features
- optimization
- problem generation
- traveling salesperson problem
language:
- iso: eng
page: 58–71
place: New York, NY, USA
publication: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-6254-2
publication_status: published
publisher: Association for Computing Machinery
series_title: FOGA ’19
status: public
title: Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators
type: conference
user_id: '102979'
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: '48840'
abstract:
- lang: eng
text: Research has shown that for many single-objective graph problems where optimum
solutions are composed of low weight sub-graphs, such as the minimum spanning
tree problem (MST), mutation operators favoring low weight edges show superior
performance. Intuitively, similar observations should hold for multi-criteria
variants of such problems. In this work, we focus on the multi-criteria MST problem.
A thorough experimental study is conducted where we estimate the probability of
edges being part of non-dominated spanning trees as a function of the edges’ non-domination
level or domination count, respectively. Building on gained insights, we propose
several biased one-edge-exchange mutation operators that differ in the used edge-selection
probability distribution (biased towards edges of low rank). Our empirical analysis
shows that among different graph types (dense and sparse) and edge weight types
(both uniformly random and combinations of Euclidean and uniformly random) biased
edge-selection strategies perform superior in contrast to the baseline uniform
edge-selection. Our findings are in particular strong for dense graphs.
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: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Grimme C, Neumann F. On the Benefits of Biased Edge-Exchange Mutation
for the Multi-Criteria Spanning Tree Problem. In: Proceedings of the Genetic
and Evolutionary Computation Conference. GECCO ’19. Association for Computing
Machinery; 2019:516–523. doi:10.1145/3321707.3321818'
apa: Bossek, J., Grimme, C., & Neumann, F. (2019). On the Benefits of Biased
Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. Proceedings
of the Genetic and Evolutionary Computation Conference, 516–523. https://doi.org/10.1145/3321707.3321818
bibtex: '@inproceedings{Bossek_Grimme_Neumann_2019, place={New York, NY, USA}, series={GECCO
’19}, title={On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria
Spanning Tree Problem}, DOI={10.1145/3321707.3321818},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme,
Christian and Neumann, Frank}, year={2019}, pages={516–523}, collection={GECCO
’19} }'
chicago: 'Bossek, Jakob, Christian Grimme, and Frank Neumann. “On the Benefits of
Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” In
Proceedings of the Genetic and Evolutionary Computation Conference, 516–523.
GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321818.'
ieee: 'J. Bossek, C. Grimme, and F. Neumann, “On the Benefits of Biased Edge-Exchange
Mutation for the Multi-Criteria Spanning Tree Problem,” in Proceedings of the
Genetic and Evolutionary Computation Conference, 2019, pp. 516–523, doi: 10.1145/3321707.3321818.'
mla: Bossek, Jakob, et al. “On the Benefits of Biased Edge-Exchange Mutation for
the Multi-Criteria Spanning Tree Problem.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2019, pp. 516–523,
doi:10.1145/3321707.3321818.
short: 'J. Bossek, C. Grimme, F. Neumann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2019, pp. 516–523.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:42:24Z
department:
- _id: '819'
doi: 10.1145/3321707.3321818
extern: '1'
keyword:
- biased mutation
- combinatorial optimization
- minimum spanning tree
- multi-objective optimization
language:
- iso: eng
page: 516–523
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: On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning
Tree Problem
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48858'
abstract:
- lang: eng
text: The $$\textbackslash mathcal NP$$-hard multi-criteria shortest path problem
(mcSPP) is of utmost practical relevance, e.~g., in navigation system design and
logistics. We address the problem of approximating the Pareto-front of the mcSPP
with sum objectives. We do so by proposing a new mutation operator for multi-objective
evolutionary algorithms that solves single-objective versions of the shortest
path problem on subgraphs. A rigorous empirical benchmark on a diverse set of
problem instances shows the effectiveness of the approach in comparison to a well-known
mutation operator in terms of convergence speed and approximation quality. In
addition, we glance at the neighbourhood structure and similarity of obtained
Pareto-optimal solutions and derive promising directions for future work.
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
citation:
ama: 'Bossek J, Grimme C. Solving Scalarized Subproblems within Evolutionary Algorithms
for Multi-criteria Shortest Path Problems. In: Battiti R, Brunato M, Kotsireas
I, Pardalos PM, eds. Learning and Intelligent Optimization. Lecture Notes
in Computer Science. Springer International Publishing; 2019:184–198. doi:10.1007/978-3-030-05348-2_17'
apa: Bossek, J., & Grimme, C. (2019). Solving Scalarized Subproblems within
Evolutionary Algorithms for Multi-criteria Shortest Path Problems. In R. Battiti,
M. Brunato, I. Kotsireas, & P. M. Pardalos (Eds.), Learning and Intelligent
Optimization (pp. 184–198). Springer International Publishing. https://doi.org/10.1007/978-3-030-05348-2_17
bibtex: '@inproceedings{Bossek_Grimme_2019, place={Cham}, series={Lecture Notes
in Computer Science}, title={Solving Scalarized Subproblems within Evolutionary
Algorithms for Multi-criteria Shortest Path Problems}, DOI={10.1007/978-3-030-05348-2_17},
booktitle={Learning and Intelligent Optimization}, publisher={Springer International
Publishing}, author={Bossek, Jakob and Grimme, Christian}, editor={Battiti, Roberto
and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}, year={2019},
pages={184–198}, collection={Lecture Notes in Computer Science} }'
chicago: 'Bossek, Jakob, and Christian Grimme. “Solving Scalarized Subproblems within
Evolutionary Algorithms for Multi-Criteria Shortest Path Problems.” In Learning
and Intelligent Optimization, edited by Roberto Battiti, Mauro Brunato, Ilias
Kotsireas, and Panos M. Pardalos, 184–198. Lecture Notes in Computer Science.
Cham: Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-05348-2_17.'
ieee: 'J. Bossek and C. Grimme, “Solving Scalarized Subproblems within Evolutionary
Algorithms for Multi-criteria Shortest Path Problems,” in Learning and Intelligent
Optimization, 2019, pp. 184–198, doi: 10.1007/978-3-030-05348-2_17.'
mla: Bossek, Jakob, and Christian Grimme. “Solving Scalarized Subproblems within
Evolutionary Algorithms for Multi-Criteria Shortest Path Problems.” Learning
and Intelligent Optimization, edited by Roberto Battiti et al., Springer International
Publishing, 2019, pp. 184–198, doi:10.1007/978-3-030-05348-2_17.
short: 'J. Bossek, C. Grimme, in: R. Battiti, M. Brunato, I. Kotsireas, P.M. Pardalos
(Eds.), Learning and Intelligent Optimization, Springer International Publishing,
Cham, 2019, pp. 184–198.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:44:44Z
department:
- _id: '819'
doi: 10.1007/978-3-030-05348-2_17
editor:
- first_name: Roberto
full_name: Battiti, Roberto
last_name: Battiti
- first_name: Mauro
full_name: Brunato, Mauro
last_name: Brunato
- first_name: Ilias
full_name: Kotsireas, Ilias
last_name: Kotsireas
- first_name: Panos M.
full_name: Pardalos, Panos M.
last_name: Pardalos
extern: '1'
language:
- iso: eng
page: 184–198
place: Cham
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-030-05348-2
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria
Shortest Path Problems
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48870'
abstract:
- lang: eng
text: The edge coloring problem asks for an assignment of colors to edges of a graph
such that no two incident edges share the same color and the number of colors
is minimized. It is known that all graphs with maximum degree {$\Delta$} can be
colored with {$\Delta$} or {$\Delta$} + 1 colors, but it is NP-hard to determine
whether {$\Delta$} colors are sufficient. We present the first runtime analysis
of evolutionary algorithms (EAs) for the edge coloring problem. Simple EAs such
as RLS and (1+1) EA efficiently find (2{$\Delta$} - 1)-colorings on arbitrary
graphs and optimal colorings for even and odd cycles, paths, star graphs and arbitrary
trees. A partial analysis for toroids also suggests efficient runtimes in bipartite
graphs with many cycles. Experiments support these findings and investigate additional
graph classes such as hypercubes, complete graphs and complete bipartite graphs.
Theoretical and experimental results suggest that simple EAs find optimal colorings
for all these graph classes in expected time O({$\Delta\mathscrl$}2m log m), where
m is the number of edges and {$\mathscrl$} is the length of the longest simple
path in the graph.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
citation:
ama: 'Bossek J, Sudholt D. Time Complexity Analysis of RLS and (1 + 1) EA for the
Edge Coloring Problem. In: Proceedings of the 15th ACM/SIGEVO Conference on
Foundations of Genetic Algorithms. FOGA ’19. Association for Computing Machinery;
2019:102–115. doi:10.1145/3299904.3340311'
apa: Bossek, J., & Sudholt, D. (2019). Time Complexity Analysis of RLS and (1
+ 1) EA for the Edge Coloring Problem. Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, 102–115. https://doi.org/10.1145/3299904.3340311
bibtex: '@inproceedings{Bossek_Sudholt_2019, place={New York, NY, USA}, series={FOGA
’19}, title={Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring
Problem}, DOI={10.1145/3299904.3340311},
booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms}, publisher={Association for Computing Machinery}, author={Bossek,
Jakob and Sudholt, Dirk}, year={2019}, pages={102–115}, collection={FOGA ’19}
}'
chicago: 'Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and
(1 + 1) EA for the Edge Coloring Problem.” In Proceedings of the 15th ACM/SIGEVO
Conference on Foundations of Genetic Algorithms, 102–115. FOGA ’19. New York,
NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3299904.3340311.'
ieee: 'J. Bossek and D. Sudholt, “Time Complexity Analysis of RLS and (1 + 1) EA
for the Edge Coloring Problem,” in Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, 2019, pp. 102–115, doi: 10.1145/3299904.3340311.'
mla: Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and (1 +
1) EA for the Edge Coloring Problem.” Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, Association for Computing Machinery,
2019, pp. 102–115, doi:10.1145/3299904.3340311.
short: 'J. Bossek, D. Sudholt, in: Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, Association for Computing Machinery, New
York, NY, USA, 2019, pp. 102–115.'
date_created: 2023-11-14T15:58:56Z
date_updated: 2023-12-13T10:46:12Z
department:
- _id: '819'
doi: 10.1145/3299904.3340311
extern: '1'
keyword:
- edge coloring problem
- runtime analysis
language:
- iso: eng
page: 102–115
place: New York, NY, USA
publication: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-6254-2
publication_status: published
publisher: Association for Computing Machinery
series_title: FOGA ’19
status: public
title: Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48875'
abstract:
- lang: eng
text: A multiobjective perspective onto common performance measures such as the
PAR10 score or the expected runtime of single-objective stochastic solvers is
presented by directly investigating the tradeoff between the fraction of failed
runs and the average runtime. Multi-objective indicators operating in the bi-objective
space allow for an overall performance comparison on a set of instances paving
the way for instance-based automated algorithm selection techniques.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Trautmann H. Multi-Objective Performance Measurement: Alternatives
to PAR10 and Expected Running Time. In: Battiti R, Brunato M, Kotsireas I, Pardalos
PM, eds. Learning and Intelligent Optimization. Lecture Notes in Computer
Science. Springer International Publishing; 2019:215–219. doi:10.1007/978-3-030-05348-2_19'
apa: 'Bossek, J., & Trautmann, H. (2019). Multi-Objective Performance Measurement:
Alternatives to PAR10 and Expected Running Time. In R. Battiti, M. Brunato, I.
Kotsireas, & P. M. Pardalos (Eds.), Learning and Intelligent Optimization
(pp. 215–219). Springer International Publishing. https://doi.org/10.1007/978-3-030-05348-2_19'
bibtex: '@inproceedings{Bossek_Trautmann_2019, place={Cham}, series={Lecture Notes
in Computer Science}, title={Multi-Objective Performance Measurement: Alternatives
to PAR10 and Expected Running Time}, DOI={10.1007/978-3-030-05348-2_19},
booktitle={Learning and Intelligent Optimization}, publisher={Springer International
Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Battiti, Roberto
and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}, year={2019},
pages={215–219}, collection={Lecture Notes in Computer Science} }'
chicago: 'Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement:
Alternatives to PAR10 and Expected Running Time.” In Learning and Intelligent
Optimization, edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, and
Panos M. Pardalos, 215–219. Lecture Notes in Computer Science. Cham: Springer
International Publishing, 2019. https://doi.org/10.1007/978-3-030-05348-2_19.'
ieee: 'J. Bossek and H. Trautmann, “Multi-Objective Performance Measurement: Alternatives
to PAR10 and Expected Running Time,” in Learning and Intelligent Optimization,
2019, pp. 215–219, doi: 10.1007/978-3-030-05348-2_19.'
mla: 'Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement:
Alternatives to PAR10 and Expected Running Time.” Learning and Intelligent
Optimization, edited by Roberto Battiti et al., Springer International Publishing,
2019, pp. 215–219, doi:10.1007/978-3-030-05348-2_19.'
short: 'J. Bossek, H. Trautmann, in: R. Battiti, M. Brunato, I. Kotsireas, P.M.
Pardalos (Eds.), Learning and Intelligent Optimization, Springer International
Publishing, Cham, 2019, pp. 215–219.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:47:32Z
department:
- _id: '819'
doi: 10.1007/978-3-030-05348-2_19
editor:
- first_name: Roberto
full_name: Battiti, Roberto
last_name: Battiti
- first_name: Mauro
full_name: Brunato, Mauro
last_name: Brunato
- first_name: Ilias
full_name: Kotsireas, Ilias
last_name: Kotsireas
- first_name: Panos M.
full_name: Pardalos, Panos M.
last_name: Pardalos
extern: '1'
keyword:
- Algorithm selection
- Performance measurement
language:
- iso: eng
page: 215–219
place: Cham
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-030-05348-2
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected
Running Time'
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48877'
abstract:
- lang: eng
text: OpenML is an online machine learning platform where researchers can easily
share data, machine learning tasks and experiments as well as organize them online
to work and collaborate more efficiently. In this paper, we present an R package
to interface with the OpenML platform and illustrate its usage in combination
with the machine learning R package mlr (Bischl et al. J Mach Learn Res 17(170):1—5,
2016). We show how the OpenML package allows R users to easily search, download
and upload data sets and machine learning tasks. Furthermore, we also show how
to upload results of experiments, share them with others and download results
from other users. Beyond ensuring reproducibility of results, the OpenML platform
automates much of the drudge work, speeds up research, facilitates collaboration
and increases the users’ visibility online.
author:
- first_name: Giuseppe
full_name: Casalicchio, Giuseppe
last_name: Casalicchio
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Michel
full_name: Lang, Michel
last_name: Lang
- first_name: Dominik
full_name: Kirchhoff, Dominik
last_name: Kirchhoff
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Benjamin
full_name: Hofner, Benjamin
last_name: Hofner
- first_name: Heidi
full_name: Seibold, Heidi
last_name: Seibold
- first_name: Joaquin
full_name: Vanschoren, Joaquin
last_name: Vanschoren
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
citation:
ama: 'Casalicchio G, Bossek J, Lang M, et al. OpenML: An R Package to Connect to
the Machine Learning Platform OpenML. Computational Statistics. 2019;34(3):977–991.
doi:10.1007/s00180-017-0742-2'
apa: 'Casalicchio, G., Bossek, J., Lang, M., Kirchhoff, D., Kerschke, P., Hofner,
B., Seibold, H., Vanschoren, J., & Bischl, B. (2019). OpenML: An R Package
to Connect to the Machine Learning Platform OpenML. Computational Statistics,
34(3), 977–991. https://doi.org/10.1007/s00180-017-0742-2'
bibtex: '@article{Casalicchio_Bossek_Lang_Kirchhoff_Kerschke_Hofner_Seibold_Vanschoren_Bischl_2019,
title={OpenML: An R Package to Connect to the Machine Learning Platform OpenML},
volume={34}, DOI={10.1007/s00180-017-0742-2},
number={3}, journal={Computational Statistics}, author={Casalicchio, Giuseppe
and Bossek, Jakob and Lang, Michel and Kirchhoff, Dominik and Kerschke, Pascal
and Hofner, Benjamin and Seibold, Heidi and Vanschoren, Joaquin and Bischl, Bernd},
year={2019}, pages={977–991} }'
chicago: 'Casalicchio, Giuseppe, Jakob Bossek, Michel Lang, Dominik Kirchhoff, Pascal
Kerschke, Benjamin Hofner, Heidi Seibold, Joaquin Vanschoren, and Bernd Bischl.
“OpenML: An R Package to Connect to the Machine Learning Platform OpenML.” Computational
Statistics 34, no. 3 (2019): 977–991. https://doi.org/10.1007/s00180-017-0742-2.'
ieee: 'G. Casalicchio et al., “OpenML: An R Package to Connect to the Machine
Learning Platform OpenML,” Computational Statistics, vol. 34, no. 3, pp.
977–991, 2019, doi: 10.1007/s00180-017-0742-2.'
mla: 'Casalicchio, Giuseppe, et al. “OpenML: An R Package to Connect to the Machine
Learning Platform OpenML.” Computational Statistics, vol. 34, no. 3, 2019,
pp. 977–991, doi:10.1007/s00180-017-0742-2.'
short: G. Casalicchio, J. Bossek, M. Lang, D. Kirchhoff, P. Kerschke, B. Hofner,
H. Seibold, J. Vanschoren, B. Bischl, Computational Statistics 34 (2019) 977–991.
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:51:17Z
department:
- _id: '819'
doi: 10.1007/s00180-017-0742-2
intvolume: ' 34'
issue: '3'
keyword:
- Databases
- Machine learning
- R
- Reproducible research
language:
- iso: eng
page: 977–991
publication: Computational Statistics
publication_identifier:
issn:
- 0943-4062
status: public
title: 'OpenML: An R Package to Connect to the Machine Learning Platform OpenML'
type: journal_article
user_id: '102979'
volume: 34
year: '2019'
...
---
_id: '52478'
author:
- first_name: Jinay D
full_name: Mehta, Jinay D
last_name: Mehta
citation:
ama: Mehta JD. Multithreaded Software/Hardware Programming with ReconOS/FreeRTOS
on a Reconfigurable System-on-Chip.; 2019.
apa: Mehta, J. D. (2019). Multithreaded Software/Hardware Programming with ReconOS/freeRTOS
on a Reconfigurable System-on-Chip.
bibtex: '@book{Mehta_2019, title={Multithreaded Software/Hardware Programming with
ReconOS/freeRTOS on a Reconfigurable System-on-Chip}, author={Mehta, Jinay D},
year={2019} }'
chicago: Mehta, Jinay D. Multithreaded Software/Hardware Programming with ReconOS/FreeRTOS
on a Reconfigurable System-on-Chip, 2019.
ieee: J. D. Mehta, Multithreaded Software/Hardware Programming with ReconOS/freeRTOS
on a Reconfigurable System-on-Chip. 2019.
mla: Mehta, Jinay D. Multithreaded Software/Hardware Programming with ReconOS/FreeRTOS
on a Reconfigurable System-on-Chip. 2019.
short: J.D. Mehta, Multithreaded Software/Hardware Programming with ReconOS/FreeRTOS
on a Reconfigurable System-on-Chip, 2019.
date_created: 2024-03-11T15:57:13Z
date_updated: 2024-03-11T15:57:39Z
department:
- _id: '78'
language:
- iso: eng
status: public
supervisor:
- first_name: Lennart
full_name: Clausing, Lennart
id: '74287'
last_name: Clausing
orcid: 0000-0003-3789-6034
title: Multithreaded Software/Hardware Programming with ReconOS/freeRTOS on a Reconfigurable
System-on-Chip
type: mastersthesis
user_id: '74287'
year: '2019'
...
---
_id: '46339'
abstract:
- lang: eng
text: 'Evolutionary algorithms have successfully been applied to evolve problem
instances that exhibit a significant difference in performance for a given algorithm
or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP).
Creating a large variety of instances is crucial for successful applications in
the blooming field of algorithm selection. In this paper, we introduce new and
creative mutation operators for evolving instances of the TSP. We show that adopting
those operators in an evolutionary algorithm allows for the generation of benchmark
sets with highly desirable properties: (1) novelty by clear visual distinction
to established benchmark sets in the field, (2) visual and quantitative diversity
in the space of TSP problem characteristics, and (3) significant performance differences
with respect to the restart versions of heuristic state-of-the-art TSP solvers
EAX and LKH. The important aspect of diversity is addressed and achieved solely
by the proposed mutation operators and not enforced by explicit diversity preservation.'
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving
Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: Friedrich
T, Doerr C, Arnold D, eds. Proceedings of the 15$^th$ ACM/SIGEVO Workshop on
Foundations of Genetic Algorithms (FOGA XV). ; 2019:58–71. doi:10.1145/3299904.3340307'
apa: Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., & Trautmann,
H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation
Operators. In T. Friedrich, C. Doerr, & D. Arnold (Eds.), Proceedings of
the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA XV)
(pp. 58–71). https://doi.org/10.1145/3299904.3340307
bibtex: '@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={Potsdam,
Germany}, title={Evolving Diverse TSP Instances by Means of Novel and Creative
Mutation Operators}, DOI={10.1145/3299904.3340307},
booktitle={Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic
Algorithms (FOGA XV)}, author={Bossek, Jakob and Kerschke, Pascal and Neumann,
Aneta and Wagner, Markus and Neumann, Frank and Trautmann, Heike}, editor={Friedrich,
Tobias and Doerr, Carola and Arnold, Dirk}, year={2019}, pages={58–71} }'
chicago: Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann,
and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative
Mutation Operators.” In Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations
of Genetic Algorithms (FOGA XV), edited by Tobias Friedrich, Carola Doerr,
and Dirk Arnold, 58–71. Potsdam, Germany, 2019. https://doi.org/10.1145/3299904.3340307.
ieee: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann,
“Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,”
in Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic
Algorithms (FOGA XV), 2019, pp. 58–71, doi: 10.1145/3299904.3340307.'
mla: Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and
Creative Mutation Operators.” Proceedings of the 15$^th$ ACM/SIGEVO Workshop
on Foundations of Genetic Algorithms (FOGA XV), edited by Tobias Friedrich
et al., 2019, pp. 58–71, doi:10.1145/3299904.3340307.
short: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann,
in: T. Friedrich, C. Doerr, D. Arnold (Eds.), Proceedings of the 15$^th$ ACM/SIGEVO
Workshop on Foundations of Genetic Algorithms (FOGA XV), Potsdam, Germany, 2019,
pp. 58–71.'
date_created: 2023-08-04T07:45:39Z
date_updated: 2024-06-10T11:59:26Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/3299904.3340307
editor:
- first_name: Tobias
full_name: Friedrich, Tobias
last_name: Friedrich
- first_name: Carola
full_name: Doerr, Carola
last_name: Doerr
- first_name: Dirk
full_name: Arnold, Dirk
last_name: Arnold
language:
- iso: eng
page: 58–71
place: Potsdam, Germany
publication: Proceedings of the 15$^th$ ACM/SIGEVO Workshop on Foundations of Genetic
Algorithms (FOGA XV)
status: public
title: Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators
type: conference
user_id: '15504'
year: '2019'
...
---
_id: '46338'
abstract:
- lang: eng
text: We tackle a bi-objective dynamic orienteering problem where customer requests
arise as time passes by. The goal is to minimize the tour length traveled by a
single delivery vehicle while simultaneously keeping the number of dismissed dynamic
customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm
which is grounded on insights gained from a previous series of work on an a-posteriori
version of the problem, where all request times are known in advance. In our experiments,
we simulate different decision maker strategies and evaluate the development of
the Pareto-front approximations on exemplary problem instances. It turns out,
that despite severely reduced computational budget and no oracle-knowledge of
request times the dynamic EMOA is capable of producing approximations which partially
dominate the results of the a-posteriori EMOA and dynamic integer linear programming
strategies.
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: Stephan
full_name: Meisel, Stephan
last_name: Meisel
- first_name: Günter
full_name: Rudolph, Günter
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Bi-Objective Orienteering:
Towards a Dynamic Multi-Objective Evolutionary Algorithm. In: Deb K, Goodman E,
Coello CCA, et al., eds. Evolutionary Multi-Criterion Optimization (EMO).
Vol 11411. Lecture Notes in Computer Science. Springer International Publishing;
2019:516–528. doi:10.1007/978-3-030-12598-1_41'
apa: 'Bossek, J., Grimme, C., Meisel, S., Rudolph, G., & Trautmann, H. (2019).
Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.
In K. Deb, E. Goodman, C. C. A. Coello, K. Klamroth, K. Miettinen, S. Mostaghim,
& P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO) (Vol.
11411, pp. 516–528). Springer International Publishing. https://doi.org/10.1007/978-3-030-12598-1_41'
bibtex: '@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2019, place={East
Lansing, Michigan, USA}, series={Lecture Notes in Computer Science}, title={Bi-Objective
Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm}, volume={11411},
DOI={10.1007/978-3-030-12598-1_41},
booktitle={Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer
International Publishing}, author={Bossek, Jakob and Grimme, Christian and Meisel,
Stephan and Rudolph, Günter and Trautmann, Heike}, editor={Deb, Kalyanmoy and
Goodman, Erik and Coello, Coello Carlos A. and Klamroth, Kathrin and Miettinen,
Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={516–528}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike
Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary
Algorithm.” In Evolutionary Multi-Criterion Optimization (EMO), edited
by Kalyanmoy Deb, Erik Goodman, Coello Carlos A. Coello, Kathrin Klamroth, Kaisa
Miettinen, Sanaz Mostaghim, and Patrick Reed, 11411:516–528. Lecture Notes in
Computer Science. East Lansing, Michigan, USA: Springer International Publishing,
2019. https://doi.org/10.1007/978-3-030-12598-1_41.'
ieee: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective
Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm,” in Evolutionary
Multi-Criterion Optimization (EMO), 2019, vol. 11411, pp. 516–528, doi: 10.1007/978-3-030-12598-1_41.'
mla: 'Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective
Evolutionary Algorithm.” Evolutionary Multi-Criterion Optimization (EMO),
edited by Kalyanmoy Deb et al., vol. 11411, Springer International Publishing,
2019, pp. 516–528, doi:10.1007/978-3-030-12598-1_41.'
short: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: K. Deb, E.
Goodman, C.C.A. Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed (Eds.),
Evolutionary Multi-Criterion Optimization (EMO), Springer International Publishing,
East Lansing, Michigan, USA, 2019, pp. 516–528.'
date_created: 2023-08-04T07:44:59Z
date_updated: 2024-06-10T12:00:05Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-030-12598-1_41
editor:
- first_name: Kalyanmoy
full_name: Deb, Kalyanmoy
last_name: Deb
- first_name: Erik
full_name: Goodman, Erik
last_name: Goodman
- first_name: Coello Carlos A.
full_name: Coello, Coello Carlos A.
last_name: Coello
- first_name: Kathrin
full_name: Klamroth, Kathrin
last_name: Klamroth
- first_name: Kaisa
full_name: Miettinen, Kaisa
last_name: Miettinen
- first_name: Sanaz
full_name: Mostaghim, Sanaz
last_name: Mostaghim
- first_name: Patrick
full_name: Reed, Patrick
last_name: Reed
intvolume: ' 11411'
language:
- iso: eng
page: 516–528
place: East Lansing, Michigan, USA
publication: Evolutionary Multi-Criterion Optimization (EMO)
publication_identifier:
isbn:
- 978-3-030-12597-4
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary
Algorithm'
type: conference
user_id: '15504'
volume: 11411
year: '2019'
...
---
_id: '46337'
abstract:
- lang: eng
text: A multiobjective perspective onto common performance measures such as the
PAR10 score or the expected runtime of single-objective stochastic solvers is
presented by directly investigating the tradeoff between the fraction of failed
runs and the average runtime. Multi-objective indicators operating in the bi-objective
space allow for an overall performance comparison on a set of instances paving
the way for instance-based automated algorithm selection techniques.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Bossek J, Trautmann H. Multi-Objective Performance Measurement: Alternatives
to PAR10 and Expected Running Time. In: Battiti R, Brunato M, Kotsireas I, Pardalos
P, eds. Learning and Intelligent Optimization. Vol 11353. Lecture Notes
in Computer Science. Springer; 2019:215–219.'
apa: 'Bossek, J., & Trautmann, H. (2019). Multi-Objective Performance Measurement:
Alternatives to PAR10 and Expected Running Time. In R. Battiti, M. Brunato, I.
Kotsireas, & P. Pardalos (Eds.), Learning and Intelligent Optimization
(Vol. 11353, pp. 215–219). Springer.'
bibtex: '@inproceedings{Bossek_Trautmann_2019, place={Cham}, series={Lecture Notes
in Computer Science}, title={Multi-Objective Performance Measurement: Alternatives
to PAR10 and Expected Running Time}, volume={11353}, booktitle={Learning and Intelligent
Optimization}, publisher={Springer}, author={Bossek, Jakob and Trautmann, Heike},
editor={Battiti, R and Brunato, M and Kotsireas, I and Pardalos, P}, year={2019},
pages={215–219}, collection={Lecture Notes in Computer Science} }'
chicago: 'Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement:
Alternatives to PAR10 and Expected Running Time.” In Learning and Intelligent
Optimization, edited by R Battiti, M Brunato, I Kotsireas, and P Pardalos,
11353:215–219. Lecture Notes in Computer Science. Cham: Springer, 2019.'
ieee: 'J. Bossek and H. Trautmann, “Multi-Objective Performance Measurement: Alternatives
to PAR10 and Expected Running Time,” in Learning and Intelligent Optimization,
2019, vol. 11353, pp. 215–219.'
mla: 'Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement:
Alternatives to PAR10 and Expected Running Time.” Learning and Intelligent
Optimization, edited by R Battiti et al., vol. 11353, Springer, 2019, pp.
215–219.'
short: 'J. Bossek, H. Trautmann, in: R. Battiti, M. Brunato, I. Kotsireas, P. Pardalos
(Eds.), Learning and Intelligent Optimization, Springer, Cham, 2019, pp. 215–219.'
date_created: 2023-08-04T07:44:10Z
date_updated: 2024-06-10T12:00:23Z
department:
- _id: '34'
- _id: '819'
editor:
- first_name: R
full_name: Battiti, R
last_name: Battiti
- first_name: M
full_name: Brunato, M
last_name: Brunato
- first_name: I
full_name: Kotsireas, I
last_name: Kotsireas
- first_name: P
full_name: Pardalos, P
last_name: Pardalos
intvolume: ' 11353'
language:
- iso: eng
page: 215–219
place: Cham
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-030-05347-5
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: 'Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected
Running Time'
type: conference
user_id: '15504'
volume: 11353
year: '2019'
...
---
_id: '10108'
abstract:
- lang: eng
text: "Recent years have seen the development of numerous tools for the analysis
of taint flows in Android apps. Taint analyses aim at detecting data leaks, accidentally
or by purpose programmed into apps. Often, such tools specialize in the treatment
of specific features impeding precise taint analysis (like reflection or inter-app
communication). This multitude of tools, their specific applicability and their
various combination options complicate the selection of a tool (or multiple tools)
when faced with an analysis instance, even for knowledgeable users, and hence
hinders the successful adoption of taint analyses.\r\n\r\nIn this work, we thus
present CoDiDroid, a framework for cooperative Android app analysis. CoDiDroid
(1) allows users to ask questions about flows in apps in varying degrees of detail,
(2) automatically generates subtasks for answering such questions, (3) distributes
tasks onto analysis tools (currently DroidRA, FlowDroid, HornDroid, IC3 and two
novel tools) and (4) at the end merges tool answers on subtasks into an overall
answer. Thereby, users are freed from having to learn about the use and functionality
of all these tools while still being able to leverage their capabilities. Moreover,
we experimentally show that cooperation among tools pays off with respect to effectiveness,
precision and scalability."
author:
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Pauck F, Wehrheim H. Together Strong: Cooperative Android App Analysis. In:
Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering. ; 2019:374-384.
doi:10.1145/3338906.3338915'
apa: 'Pauck, F., & Wehrheim, H. (2019). Together Strong: Cooperative Android
App Analysis. Proceedings of the 2019 27th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering,
374–384. https://doi.org/10.1145/3338906.3338915'
bibtex: '@inproceedings{Pauck_Wehrheim_2019, title={Together Strong: Cooperative
Android App Analysis}, DOI={10.1145/3338906.3338915},
booktitle={Proceedings of the 2019 27th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering},
author={Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={374–384} }'
chicago: 'Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android
App Analysis.” In Proceedings of the 2019 27th ACM Joint Meeting on European
Software Engineering Conference and Symposium on the Foundations of Software Engineering,
374–84, 2019. https://doi.org/10.1145/3338906.3338915.'
ieee: 'F. Pauck and H. Wehrheim, “Together Strong: Cooperative Android App Analysis,”
in Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering, 2019,
pp. 374–384, doi: 10.1145/3338906.3338915.'
mla: 'Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App
Analysis.” Proceedings of the 2019 27th ACM Joint Meeting on European Software
Engineering Conference and Symposium on the Foundations of Software Engineering,
2019, pp. 374–84, doi:10.1145/3338906.3338915.'
short: 'F. Pauck, H. Wehrheim, in: Proceedings of the 2019 27th ACM Joint Meeting
on European Software Engineering Conference and Symposium on the Foundations of
Software Engineering, 2019, pp. 374–384.'
date_created: 2019-06-04T11:15:25Z
date_updated: 2023-01-18T08:32:47Z
ddc:
- '004'
department:
- _id: '77'
doi: 10.1145/3338906.3338915
file:
- access_level: closed
content_type: application/pdf
creator: fpauck
date_created: 2019-08-20T08:47:20Z
date_updated: 2019-08-20T08:47:20Z
file_id: '12947'
file_name: fse19main-id44-p-ef9ce42-41855-final.pdf
file_size: 442603
relation: main_file
file_date_updated: 2019-08-20T08:47:20Z
has_accepted_license: '1'
keyword:
- Android Taint Analysis
- Cooperation
- Precision
- Tools
language:
- iso: eng
page: 374-384
project:
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
- _id: '12'
name: SFB 901 - Subproject B4
publication: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering
Conference and Symposium on the Foundations of Software Engineering
publication_identifier:
isbn:
- 978-1-4503-5572-8
publication_status: published
status: public
title: 'Together Strong: Cooperative Android App Analysis'
type: conference
user_id: '22398'
year: '2019'
...
---
_id: '13874'
author:
- first_name: Tobias
full_name: Isenberg, Tobias
last_name: Isenberg
- first_name: Marie-Christine
full_name: Jakobs, Marie-Christine
last_name: Jakobs
- first_name: Felix
full_name: Pauck, Felix
id: '22398'
last_name: Pauck
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. When Are Software Verification
Results Valid for Approximate Hardware? In: Tests and Proofs - 13th International
Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods
2019, Porto, Portugal, October 9-11, 2019, Proceedings. ; 2019:3-20. doi:10.1007/978-3-030-31157-5_1'
apa: Isenberg, T., Jakobs, M.-C., Pauck, F., & Wehrheim, H. (2019). When Are
Software Verification Results Valid for Approximate Hardware? Tests and Proofs
- 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress
on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings,
3–20. https://doi.org/10.1007/978-3-030-31157-5_1
bibtex: '@inproceedings{Isenberg_Jakobs_Pauck_Wehrheim_2019, title={When Are Software
Verification Results Valid for Approximate Hardware?}, DOI={10.1007/978-3-030-31157-5_1},
booktitle={Tests and Proofs - 13th International Conference, {TAP} 2019, Held
as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October
9-11, 2019, Proceedings}, author={Isenberg, Tobias and Jakobs, Marie-Christine
and Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={3–20} }'
chicago: Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim.
“When Are Software Verification Results Valid for Approximate Hardware?” In Tests
and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third
World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings,
3–20, 2019. https://doi.org/10.1007/978-3-030-31157-5_1.
ieee: 'T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “When Are Software
Verification Results Valid for Approximate Hardware?,” in Tests and Proofs
- 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress
on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings,
2019, pp. 3–20, doi: 10.1007/978-3-030-31157-5_1.'
mla: Isenberg, Tobias, et al. “When Are Software Verification Results Valid for
Approximate Hardware?” Tests and Proofs - 13th International Conference, {TAP}
2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto,
Portugal, October 9-11, 2019, Proceedings, 2019, pp. 3–20, doi:10.1007/978-3-030-31157-5_1.
short: 'T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, in: Tests and Proofs -
13th International Conference, {TAP} 2019, Held as Part of the Third World Congress
on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings, 2019,
pp. 3–20.'
date_created: 2019-10-16T09:40:20Z
date_updated: 2023-01-18T08:41:17Z
department:
- _id: '77'
doi: 10.1007/978-3-030-31157-5_1
language:
- iso: eng
page: 3-20
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '3'
name: SFB 901 - Project Area B
- _id: '1'
name: SFB 901
publication: Tests and Proofs - 13th International Conference, {TAP} 2019, Held as
Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October
9-11, 2019, Proceedings
publication_status: published
status: public
title: When Are Software Verification Results Valid for Approximate Hardware?
type: conference
user_id: '22398'
year: '2019'
...
---
_id: '20243'
author:
- first_name: Katharina
full_name: Rohlfing, Katharina
id: '50352'
last_name: Rohlfing
- first_name: Giuseppe
full_name: Leonardi, Giuseppe
last_name: Leonardi
- first_name: Iris
full_name: Nomikou, Iris
last_name: Nomikou
- first_name: Joanna
full_name: Rączaszek-Leonardi, Joanna
last_name: Rączaszek-Leonardi
- first_name: Eyke
full_name: Hüllermeier, Eyke
id: '48129'
last_name: Hüllermeier
citation:
ama: 'Rohlfing K, Leonardi G, Nomikou I, Rączaszek-Leonardi J, Hüllermeier E. Multimodal
Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches. IEEE
Transactions on Cognitive and Developmental Systems. Published online 2019.
doi:10.1109/TCDS.2019.2892991'
apa: 'Rohlfing, K., Leonardi, G., Nomikou, I., Rączaszek-Leonardi, J., & Hüllermeier,
E. (2019). Multimodal Turn-Taking: Motivations, Methodological Challenges, and
Novel Approaches. IEEE Transactions on Cognitive and Developmental Systems.
https://doi.org/10.1109/TCDS.2019.2892991'
bibtex: '@article{Rohlfing_Leonardi_Nomikou_Rączaszek-Leonardi_Hüllermeier_2019,
title={Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel
Approaches}, DOI={10.1109/TCDS.2019.2892991},
journal={IEEE Transactions on Cognitive and Developmental Systems}, author={Rohlfing,
Katharina and Leonardi, Giuseppe and Nomikou, Iris and Rączaszek-Leonardi, Joanna
and Hüllermeier, Eyke}, year={2019} }'
chicago: 'Rohlfing, Katharina, Giuseppe Leonardi, Iris Nomikou, Joanna Rączaszek-Leonardi,
and Eyke Hüllermeier. “Multimodal Turn-Taking: Motivations, Methodological Challenges,
and Novel Approaches.” IEEE Transactions on Cognitive and Developmental Systems,
2019. https://doi.org/10.1109/TCDS.2019.2892991.'
ieee: 'K. Rohlfing, G. Leonardi, I. Nomikou, J. Rączaszek-Leonardi, and E. Hüllermeier,
“Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel Approaches,”
IEEE Transactions on Cognitive and Developmental Systems, 2019, doi: 10.1109/TCDS.2019.2892991.'
mla: 'Rohlfing, Katharina, et al. “Multimodal Turn-Taking: Motivations, Methodological
Challenges, and Novel Approaches.” IEEE Transactions on Cognitive and Developmental
Systems, 2019, doi:10.1109/TCDS.2019.2892991.'
short: K. Rohlfing, G. Leonardi, I. Nomikou, J. Rączaszek-Leonardi, E. Hüllermeier,
IEEE Transactions on Cognitive and Developmental Systems (2019).
date_created: 2020-11-02T13:25:49Z
date_updated: 2023-02-01T12:39:19Z
department:
- _id: '749'
- _id: '355'
doi: 10.1109/TCDS.2019.2892991
language:
- iso: eng
publication: IEEE Transactions on Cognitive and Developmental Systems
status: public
title: 'Multimodal Turn-Taking: Motivations, Methodological Challenges, and Novel
Approaches'
type: journal_article
user_id: '14931'
year: '2019'
...
---
_id: '13297'
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Ojas
full_name: Parekh, Ojas
last_name: Parekh
citation:
ama: 'Gharibian S, Parekh O. Almost Optimal Classical Approximation Algorithms for
a Quantum Generalization of Max-Cut. In: Proceedings of the 22nd International
Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX).
Vol 145. Leibniz International Proceedings in Informatics (LIPIcs). ; 2019:31:1-31:17.
doi:10.4230/LIPICS.APPROX-RANDOM.2019.31'
apa: Gharibian, S., & Parekh, O. (2019). Almost Optimal Classical Approximation
Algorithms for a Quantum Generalization of Max-Cut. Proceedings of the 22nd
International Workshop on Approximation Algorithms for Combinatorial Optimization
Problems (APPROX), 145, 31:1-31:17. https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31
bibtex: '@inproceedings{Gharibian_Parekh_2019, series={Leibniz International Proceedings
in Informatics (LIPIcs)}, title={Almost Optimal Classical Approximation Algorithms
for a Quantum Generalization of Max-Cut}, volume={145}, DOI={10.4230/LIPICS.APPROX-RANDOM.2019.31},
booktitle={Proceedings of the 22nd International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems (APPROX)}, author={Gharibian, Sevag and
Parekh, Ojas}, year={2019}, pages={31:1-31:17}, collection={Leibniz International
Proceedings in Informatics (LIPIcs)} }'
chicago: Gharibian, Sevag, and Ojas Parekh. “Almost Optimal Classical Approximation
Algorithms for a Quantum Generalization of Max-Cut.” In Proceedings of the
22nd International Workshop on Approximation Algorithms for Combinatorial Optimization
Problems (APPROX), 145:31:1-31:17. Leibniz International Proceedings in Informatics
(LIPIcs), 2019. https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31.
ieee: 'S. Gharibian and O. Parekh, “Almost Optimal Classical Approximation Algorithms
for a Quantum Generalization of Max-Cut,” in Proceedings of the 22nd International
Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX),
2019, vol. 145, p. 31:1-31:17, doi: 10.4230/LIPICS.APPROX-RANDOM.2019.31.'
mla: Gharibian, Sevag, and Ojas Parekh. “Almost Optimal Classical Approximation
Algorithms for a Quantum Generalization of Max-Cut.” Proceedings of the 22nd
International Workshop on Approximation Algorithms for Combinatorial Optimization
Problems (APPROX), vol. 145, 2019, p. 31:1-31:17, doi:10.4230/LIPICS.APPROX-RANDOM.2019.31.
short: 'S. Gharibian, O. Parekh, in: Proceedings of the 22nd International Workshop
on Approximation Algorithms for Combinatorial Optimization Problems (APPROX),
2019, p. 31:1-31:17.'
date_created: 2019-09-19T08:33:29Z
date_updated: 2023-02-28T11:05:46Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPICS.APPROX-RANDOM.2019.31
intvolume: ' 145'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/volltexte/2019/11246/
oa: '1'
page: 31:1-31:17
publication: Proceedings of the 22nd International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems (APPROX)
publication_status: published
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Almost Optimal Classical Approximation Algorithms for a Quantum Generalization
of Max-Cut
type: conference
user_id: '71541'
volume: 145
year: '2019'
...
---
_id: '13558'
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: 'Justin '
full_name: 'Yirka, Justin '
last_name: Yirka
citation:
ama: Gharibian S, Yirka J. The complexity of simulating local measurements on quantum
systems. Quantum. 2019;3:189. doi:10.22331/q-2019-09-30-189
apa: Gharibian, S., & Yirka, J. (2019). The complexity of simulating local measurements
on quantum systems. Quantum, 3, 189. https://doi.org/10.22331/q-2019-09-30-189
bibtex: '@article{Gharibian_Yirka_2019, title={The complexity of simulating local
measurements on quantum systems}, volume={3}, DOI={10.22331/q-2019-09-30-189},
journal={Quantum}, author={Gharibian, Sevag and Yirka, Justin }, year={2019},
pages={189} }'
chicago: 'Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local
Measurements on Quantum Systems.” Quantum 3 (2019): 189. https://doi.org/10.22331/q-2019-09-30-189.'
ieee: 'S. Gharibian and J. Yirka, “The complexity of simulating local measurements
on quantum systems,” Quantum, vol. 3, p. 189, 2019, doi: 10.22331/q-2019-09-30-189.'
mla: Gharibian, Sevag, and Justin Yirka. “The Complexity of Simulating Local Measurements
on Quantum Systems.” Quantum, vol. 3, 2019, p. 189, doi:10.22331/q-2019-09-30-189.
short: S. Gharibian, J. Yirka, Quantum 3 (2019) 189.
date_created: 2019-10-01T08:25:27Z
date_updated: 2023-02-28T11:05:35Z
department:
- _id: '623'
- _id: '7'
doi: 10.22331/q-2019-09-30-189
intvolume: ' 3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://quantum-journal.org/papers/q-2019-09-30-189/
oa: '1'
page: '189'
publication: Quantum
publication_status: published
status: public
title: The complexity of simulating local measurements on quantum systems
type: journal_article
user_id: '71541'
volume: 3
year: '2019'
...
---
_id: '9913'
abstract:
- lang: eng
text: Reconfigurable hardware has received considerable attention as a platform
that enables dynamic hardware updates and thus is able to adapt new configurations
at runtime. However, due to their dynamic nature, e.g., field-programmable gate
arrays (FPGA) are subject to a constant possibility of attacks, since each new
configuration might be compromised. Trojans for reconfigurable hardware that evade
state-of-the-art detection techniques and even formal verification, are thus a
large threat to these devices. One such stealthy hardware Trojan, that is inserted
and activated in two stages by compromised electronic design automation (EDA)
tools, has recently been presented and shown to evade all forms of classical pre-configuration
detection techniques. This paper presents a successful pre-configuration countermeasure
against this ``Malicious Look-up-table (LUT)''-hardware Trojan, by employing bitstream-level
Proof-Carrying Hardware (PCH). We show that the method is able to alert innocent
module creators to infected EDA tools, and to prohibit malicious ones to sell
infected modules to unsuspecting customers.
author:
- first_name: Qazi Arbab
full_name: Ahmed, Qazi Arbab
id: '72764'
last_name: Ahmed
orcid: 0000-0002-1837-2254
- first_name: Tobias
full_name: Wiersema, Tobias
id: '3118'
last_name: Wiersema
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Ahmed QA, Wiersema T, Platzner M. Proof-Carrying Hardware Versus the Stealthy
Malicious LUT Hardware Trojan. In: Hochberger C, Nelson B, Koch A, Woods R, Diniz
P, eds. Applied Reconfigurable Computing. Vol 11444. Lecture Notes in Computer
Science. Springer International Publishing; 2019:127-136. doi:10.1007/978-3-030-17227-5_10'
apa: Ahmed, Q. A., Wiersema, T., & Platzner, M. (2019). Proof-Carrying Hardware
Versus the Stealthy Malicious LUT Hardware Trojan. In C. Hochberger, B. Nelson,
A. Koch, R. Woods, & P. Diniz (Eds.), Applied Reconfigurable Computing
(Vol. 11444, pp. 127–136). Springer International Publishing. https://doi.org/10.1007/978-3-030-17227-5_10
bibtex: '@inproceedings{Ahmed_Wiersema_Platzner_2019, place={Cham}, series={Lecture
Notes in Computer Science}, title={Proof-Carrying Hardware Versus the Stealthy
Malicious LUT Hardware Trojan}, volume={11444}, DOI={10.1007/978-3-030-17227-5_10},
booktitle={Applied Reconfigurable Computing}, publisher={Springer International
Publishing}, author={Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco},
editor={Hochberger, Christian and Nelson, Brent and Koch, Andreas and Woods, Roger
and Diniz, Pedro}, year={2019}, pages={127–136}, collection={Lecture Notes in
Computer Science} }'
chicago: 'Ahmed, Qazi Arbab, Tobias Wiersema, and Marco Platzner. “Proof-Carrying
Hardware Versus the Stealthy Malicious LUT Hardware Trojan.” In Applied Reconfigurable
Computing, edited by Christian Hochberger, Brent Nelson, Andreas Koch, Roger
Woods, and Pedro Diniz, 11444:127–36. Lecture Notes in Computer Science. Cham:
Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-17227-5_10.'
ieee: 'Q. A. Ahmed, T. Wiersema, and M. Platzner, “Proof-Carrying Hardware Versus
the Stealthy Malicious LUT Hardware Trojan,” in Applied Reconfigurable Computing,
Darmstadt, Germany, 2019, vol. 11444, pp. 127–136, doi: 10.1007/978-3-030-17227-5_10.'
mla: Ahmed, Qazi Arbab, et al. “Proof-Carrying Hardware Versus the Stealthy Malicious
LUT Hardware Trojan.” Applied Reconfigurable Computing, edited by Christian
Hochberger et al., vol. 11444, Springer International Publishing, 2019, pp. 127–36,
doi:10.1007/978-3-030-17227-5_10.
short: 'Q.A. Ahmed, T. Wiersema, M. Platzner, in: C. Hochberger, B. Nelson, A. Koch,
R. Woods, P. Diniz (Eds.), Applied Reconfigurable Computing, Springer International
Publishing, Cham, 2019, pp. 127–136.'
conference:
end_date: 2019-04-11
location: Darmstadt, Germany
name: 15th International Symposium on Applied Reconfigurable Computing (ARC 2019)
start_date: 2019-04-09
date_created: 2019-05-22T07:36:05Z
date_updated: 2023-05-15T08:13:37Z
ddc:
- '000'
department:
- _id: '78'
doi: 10.1007/978-3-030-17227-5_10
editor:
- first_name: Christian
full_name: Hochberger, Christian
last_name: Hochberger
- first_name: Brent
full_name: Nelson, Brent
last_name: Nelson
- first_name: Andreas
full_name: Koch, Andreas
last_name: Koch
- first_name: Roger
full_name: Woods, Roger
last_name: Woods
- first_name: Pedro
full_name: Diniz, Pedro
last_name: Diniz
file:
- access_level: closed
content_type: application/pdf
creator: qazi
date_created: 2023-05-11T09:12:33Z
date_updated: 2023-05-11T09:12:33Z
file_id: '44749'
file_name: 978-3-030-17227-5_10.pdf
file_size: 661354
relation: main_file
success: 1
file_date_updated: 2023-05-11T09:12:33Z
has_accepted_license: '1'
intvolume: ' 11444'
language:
- iso: eng
main_file_link:
- open_access: '1'
oa: '1'
page: 127-136
place: Cham
project:
- _id: '12'
name: SFB 901 - Subproject B4
- _id: '1'
name: SFB 901
- _id: '3'
name: SFB 901 - Project Area B
publication: Applied Reconfigurable Computing
publication_identifier:
isbn:
- 978-3-030-17227-5
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan
type: conference
user_id: '72764'
volume: 11444
year: '2019'
...
---
_id: '45231'
author:
- first_name: N.
full_name: N., N.
last_name: N.
citation:
ama: N. N. Conception of a Digital Sales Bonus System Based on Blockchain Technology.;
2019.
apa: N., N. (2019). Conception of a digital Sales Bonus System based on Blockchain
Technology.
bibtex: '@book{N._2019, title={Conception of a digital Sales Bonus System based
on Blockchain Technology}, author={N., N.}, year={2019} }'
chicago: N., N. Conception of a Digital Sales Bonus System Based on Blockchain
Technology, 2019.
ieee: N. N., Conception of a digital Sales Bonus System based on Blockchain Technology.
2019.
mla: N., N. Conception of a Digital Sales Bonus System Based on Blockchain Technology.
2019.
short: N. N., Conception of a Digital Sales Bonus System Based on Blockchain Technology,
2019.
date_created: 2023-05-23T13:00:40Z
date_updated: 2023-05-23T13:00:49Z
department:
- _id: '66'
language:
- iso: eng
project:
- _id: '1'
name: 'SFB 901: SFB 901'
- _id: '4'
name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '17'
name: 'SFB 901 - C5: SFB 901 - Subproject C5'
status: public
supervisor:
- first_name: Thim Frederik
full_name: Strothmann, Thim Frederik
id: '11319'
last_name: Strothmann
- first_name: Sebastian
full_name: Gottschalk, Sebastian
id: '47208'
last_name: Gottschalk
title: Conception of a digital Sales Bonus System based on Blockchain Technology
type: bachelorsthesis
user_id: '47208'
year: '2019'
...