---
_id: '46369'
abstract:
- lang: eng
text: This paper formally defines multimodality in multiobjective optimization (MO).
We introduce a test-bed in which multimodal MO problems with known properties
can be constructed as well as numerical characteristics of the resulting landscape.
Gradient- and local search based strategies are compared on exemplary problems
together with specific performance indicators in the multimodal MO setting. By
this means the foundation for Exploratory Landscape Analysis in MO is provided.
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. Towards Analyzing Multimodality of Multiobjective
Landscapes. In: Proceedings of the 14$^th$ International Conference on Parallel
Problem Solving from Nature (PPSN XIV). Lecture Notes in Computer Science.
Springer; 2016:962–972. doi:10.1007/978-3-319-45823-6_90'
apa: Kerschke, P., Wang, H., Preuss, M., Grimme, C., Deutz, A., Trautmann, H., &
Emmerich, M. (2016). Towards Analyzing Multimodality of Multiobjective Landscapes.
Proceedings of the 14$^th$ International Conference on Parallel Problem Solving
from Nature (PPSN XIV), 962–972. https://doi.org/10.1007/978-3-319-45823-6_90
bibtex: '@inproceedings{Kerschke_Wang_Preuss_Grimme_Deutz_Trautmann_Emmerich_2016,
place={Edinburgh, Scotland}, series={Lecture Notes in Computer Science}, title={Towards
Analyzing Multimodality of Multiobjective Landscapes}, DOI={10.1007/978-3-319-45823-6_90},
booktitle={Proceedings of the 14$^th$ International Conference on Parallel Problem
Solving from Nature (PPSN XIV)}, publisher={Springer}, author={Kerschke, Pascal
and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann,
Heike and Emmerich, Michael}, year={2016}, pages={962–972}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Kerschke, Pascal, Hao Wang, Mike Preuss, Christian Grimme, André Deutz,
Heike Trautmann, and Michael Emmerich. “Towards Analyzing Multimodality of Multiobjective
Landscapes.” In Proceedings of the 14$^th$ International Conference on Parallel
Problem Solving from Nature (PPSN XIV), 962–972. Lecture Notes in Computer
Science. Edinburgh, Scotland: Springer, 2016. https://doi.org/10.1007/978-3-319-45823-6_90.'
ieee: 'P. Kerschke et al., “Towards Analyzing Multimodality of Multiobjective
Landscapes,” in Proceedings of the 14$^th$ International Conference on Parallel
Problem Solving from Nature (PPSN XIV), 2016, pp. 962–972, doi: 10.1007/978-3-319-45823-6_90.'
mla: Kerschke, Pascal, et al. “Towards Analyzing Multimodality of Multiobjective
Landscapes.” Proceedings of the 14$^th$ International Conference on Parallel
Problem Solving from Nature (PPSN XIV), Springer, 2016, pp. 962–972, doi:10.1007/978-3-319-45823-6_90.
short: 'P. Kerschke, H. Wang, M. Preuss, C. Grimme, A. Deutz, H. Trautmann, M. Emmerich,
in: Proceedings of the 14$^th$ International Conference on Parallel Problem Solving
from Nature (PPSN XIV), Springer, Edinburgh, Scotland, 2016, pp. 962–972.'
date_created: 2023-08-04T15:16:02Z
date_updated: 2023-10-16T13:39:42Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-45823-6_90
language:
- iso: eng
page: 962–972
place: Edinburgh, Scotland
publication: Proceedings of the 14$^th$ International Conference on Parallel Problem
Solving from Nature (PPSN XIV)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Towards Analyzing Multimodality of Multiobjective Landscapes
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '46367'
abstract:
- lang: eng
text: When selecting the best suited algorithm for an unknown optimization problem,
it is useful to possess some a priori knowledge of the problem at hand. In the
context of single-objective, continuous optimization problems such knowledge can
be retrieved by means of Exploratory Landscape Analysis (ELA), which automatically
identifies properties of a landscape, e.g., the so-called funnel structures, based
on an initial sample. In this paper, we extract the relevant features (for detecting
funnels) out of a large set of landscape features when only given a small initial
sample consisting of 50 x D observations, where D is the number of decision space
dimensions. This is already in the range of the start population sizes of many
evolutionary algorithms. The new Multiple Peaks Model Generator (MPM2) is used
for training the classifier, and the approach is then very successfully validated
on the Black-Box Optimization Benchmark (BBOB) and a subset of the CEC 2013 niching
competition problems.
author:
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Mike
full_name: Preuss, Mike
last_name: Preuss
- first_name: Simon
full_name: Wessing, Simon
last_name: Wessing
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Kerschke P, Preuss M, Wessing S, Trautmann H. Low-Budget Exploratory Landscape
Analysis on Multiple Peaks Models. In: Proceedings of the 18$^th$ Annual Conference
on Genetic and Evolutionary Computation. ; 2016:229–236. doi:10.1145/2908812.2908845'
apa: Kerschke, P., Preuss, M., Wessing, S., & Trautmann, H. (2016). Low-Budget
Exploratory Landscape Analysis on Multiple Peaks Models. Proceedings of the
18$^th$ Annual Conference on Genetic and Evolutionary Computation, 229–236.
https://doi.org/10.1145/2908812.2908845
bibtex: '@inproceedings{Kerschke_Preuss_Wessing_Trautmann_2016, place={Denver, CO,
USA}, title={Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models},
DOI={10.1145/2908812.2908845},
booktitle={Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary
Computation}, author={Kerschke, Pascal and Preuss, Mike and Wessing, Simon and
Trautmann, Heike}, year={2016}, pages={229–236} }'
chicago: Kerschke, Pascal, Mike Preuss, Simon Wessing, and Heike Trautmann. “Low-Budget
Exploratory Landscape Analysis on Multiple Peaks Models.” In Proceedings of
the 18$^th$ Annual Conference on Genetic and Evolutionary Computation, 229–236.
Denver, CO, USA, 2016. https://doi.org/10.1145/2908812.2908845.
ieee: 'P. Kerschke, M. Preuss, S. Wessing, and H. Trautmann, “Low-Budget Exploratory
Landscape Analysis on Multiple Peaks Models,” in Proceedings of the 18$^th$
Annual Conference on Genetic and Evolutionary Computation, 2016, pp. 229–236,
doi: 10.1145/2908812.2908845.'
mla: Kerschke, Pascal, et al. “Low-Budget Exploratory Landscape Analysis on Multiple
Peaks Models.” Proceedings of the 18$^th$ Annual Conference on Genetic and
Evolutionary Computation, 2016, pp. 229–236, doi:10.1145/2908812.2908845.
short: 'P. Kerschke, M. Preuss, S. Wessing, H. Trautmann, in: Proceedings of the
18$^th$ Annual Conference on Genetic and Evolutionary Computation, Denver, CO,
USA, 2016, pp. 229–236.'
date_created: 2023-08-04T15:14:06Z
date_updated: 2023-10-16T13:38:47Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2908812.2908845
language:
- iso: eng
page: 229–236
place: Denver, CO, USA
publication: Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary
Computation
publication_identifier:
isbn:
- 978-1-4503-4206-3
status: public
title: Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '46371'
abstract:
- lang: eng
text: "One main task in evolutionary multiobjective optimization (EMO) is to obtain
a suitable finite size approximation of the Pareto front which is the image of
the solution set, termed the Pareto set, of a given multiobjective optimization
problem. In the technical literature, the characteristic of the desired approximation
is commonly expressed by closeness to the Pareto front and a sufficient spread
of the solutions obtained. In this paper, we first make an effort to show by theoretical
and empirical findings that the recently proposed Averaged Hausdorff (or Δ\U0001D45D-)
indicator indeed aims at fulfilling both performance criteria for bi-objective
optimization problems. In the second part of this paper, standard EMO algorithms
combined with a specialized archiver and a postprocessing step based on the Δ\U0001D45D
indicator are introduced which sufficiently approximate the Δ\U0001D45D-optimal
archives and generate solutions evenly spread along the Pareto front."
author:
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: C
full_name: Grimme, C
last_name: Grimme
- first_name: C
full_name: Domínguez-Medina, C
last_name: Domínguez-Medina
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Rudolph G, Schütze O, Grimme C, Domínguez-Medina C, Trautmann H. Optimal averaged
Hausdorff archives for bi-objective problems: theoretical and numerical results.
Computational Optimization and Applications (Comput Optim Appl). 2016;64(2):589–618.
doi:10.1007/s10589-015-9815-8'
apa: 'Rudolph, G., Schütze, O., Grimme, C., Domínguez-Medina, C., & Trautmann,
H. (2016). Optimal averaged Hausdorff archives for bi-objective problems: theoretical
and numerical results. Computational Optimization and Applications (Comput.
Optim. Appl.), 64(2), 589–618. https://doi.org/10.1007/s10589-015-9815-8'
bibtex: '@article{Rudolph_Schütze_Grimme_Domínguez-Medina_Trautmann_2016, title={Optimal
averaged Hausdorff archives for bi-objective problems: theoretical and numerical
results}, volume={64}, DOI={10.1007/s10589-015-9815-8},
number={2}, journal={Computational Optimization and Applications (Comput. Optim.
Appl.)}, author={Rudolph, G and Schütze, O and Grimme, C and Domínguez-Medina,
C and Trautmann, Heike}, year={2016}, pages={589–618} }'
chicago: 'Rudolph, G, O Schütze, C Grimme, C Domínguez-Medina, and Heike Trautmann.
“Optimal Averaged Hausdorff Archives for Bi-Objective Problems: Theoretical and
Numerical Results.” Computational Optimization and Applications (Comput. Optim.
Appl.) 64, no. 2 (2016): 589–618. https://doi.org/10.1007/s10589-015-9815-8.'
ieee: 'G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, and H. Trautmann,
“Optimal averaged Hausdorff archives for bi-objective problems: theoretical and
numerical results,” Computational Optimization and Applications (Comput. Optim.
Appl.), vol. 64, no. 2, pp. 589–618, 2016, doi: 10.1007/s10589-015-9815-8.'
mla: 'Rudolph, G., et al. “Optimal Averaged Hausdorff Archives for Bi-Objective
Problems: Theoretical and Numerical Results.” Computational Optimization and
Applications (Comput. Optim. Appl.), vol. 64, no. 2, 2016, pp. 589–618, doi:10.1007/s10589-015-9815-8.'
short: G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, H. Trautmann, Computational
Optimization and Applications (Comput. Optim. Appl.) 64 (2016) 589–618.
date_created: 2023-08-04T15:17:48Z
date_updated: 2023-10-16T13:40:21Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/s10589-015-9815-8
intvolume: ' 64'
issue: '2'
language:
- iso: eng
page: 589–618
publication: Computational Optimization and Applications (Comput. Optim. Appl.)
status: public
title: 'Optimal averaged Hausdorff archives for bi-objective problems: theoretical
and numerical results'
type: journal_article
user_id: '15504'
volume: 64
year: '2016'
...
---
_id: '46372'
abstract:
- lang: eng
text: We present a new hybrid evolutionary algorithm for the effective hypervolume
approximation of the Pareto front of a given differentiable multi-objective optimization
problem. Starting point for the local search (LS) mechanism is a new division
of the decision space as we will argue that in each of these regions a different
LS strategy seems to be most promising. For the LS in two out of the three regions
we will utilize and adapt the Directed Search method which is capable of steering
the search into any direction given in objective space and which is thus well
suited for the problem at hand. We further on integrate the resulting LS mechanism
into SMS-EMOA, a state-of-the-art evolutionary algorithm for hypervolume approximations.
Finally, we will present some numerical results on several benchmark problems
with two and three objectives indicating the strength and competitiveness of the
novel hybrid.
author:
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: Hernandez VA
full_name: Sosa, Hernandez VA
last_name: Sosa
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
citation:
ama: Schütze O, Sosa HV, Trautmann H, Rudolph G. The Hypervolume based Directed
Search Method for Multi-Objective Optimization Problems. Journal of Heuristics.
2016;22(3):273–300. doi:10.1007/s10732-016-9310-0
apa: Schütze, O., Sosa, H. V., Trautmann, H., & Rudolph, G. (2016). The Hypervolume
based Directed Search Method for Multi-Objective Optimization Problems. Journal
of Heuristics, 22(3), 273–300. https://doi.org/10.1007/s10732-016-9310-0
bibtex: '@article{Schütze_Sosa_Trautmann_Rudolph_2016, title={The Hypervolume based
Directed Search Method for Multi-Objective Optimization Problems}, volume={22},
DOI={10.1007/s10732-016-9310-0},
number={3}, journal={Journal of Heuristics}, author={Schütze, O and Sosa, Hernandez
VA and Trautmann, Heike and Rudolph, G}, year={2016}, pages={273–300} }'
chicago: 'Schütze, O, Hernandez VA Sosa, Heike Trautmann, and G Rudolph. “The Hypervolume
Based Directed Search Method for Multi-Objective Optimization Problems.” Journal
of Heuristics 22, no. 3 (2016): 273–300. https://doi.org/10.1007/s10732-016-9310-0.'
ieee: 'O. Schütze, H. V. Sosa, H. Trautmann, and G. Rudolph, “The Hypervolume based
Directed Search Method for Multi-Objective Optimization Problems,” Journal
of Heuristics, vol. 22, no. 3, pp. 273–300, 2016, doi: 10.1007/s10732-016-9310-0.'
mla: Schütze, O., et al. “The Hypervolume Based Directed Search Method for Multi-Objective
Optimization Problems.” Journal of Heuristics, vol. 22, no. 3, 2016, pp.
273–300, doi:10.1007/s10732-016-9310-0.
short: O. Schütze, H.V. Sosa, H. Trautmann, G. Rudolph, Journal of Heuristics 22
(2016) 273–300.
date_created: 2023-08-04T15:19:11Z
date_updated: 2023-10-16T13:40:43Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/s10732-016-9310-0
intvolume: ' 22'
issue: '3'
language:
- iso: eng
page: 273–300
publication: Journal of Heuristics
status: public
title: The Hypervolume based Directed Search Method for Multi-Objective Optimization
Problems
type: journal_article
user_id: '15504'
volume: 22
year: '2016'
...
---
_id: '46368'
abstract:
- lang: eng
text: Exploratory Landscape Analysis (ELA) aims at understanding characteristics
of single-objective continuous (black-box) optimization problems in an automated
way. Moreover, the approach provides the basis for constructing algorithm selection
models for unseen problem instances. Recently, it has gained increasing attention
and numerical features have been designed by various research groups. This paper
introduces the R-Package FLACCO which makes all relevant features available in
a unified framework together with efficient helper functions. Moreover, a case
study which gives perspectives to ELA for multi-objective optimization problems
is presented.
author:
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Kerschke P, Trautmann H. The R-Package FLACCO for Exploratory Landscape Analysis
with Applications to Multi-Objective Optimization Problems. In: Proceedings
of the IEEE Congress on Evolutionary Computation (CEC). ; 2016. doi:10.1109/CEC.2016.7748359'
apa: Kerschke, P., & Trautmann, H. (2016). The R-Package FLACCO for Exploratory
Landscape Analysis with Applications to Multi-Objective Optimization Problems.
Proceedings of the IEEE Congress on Evolutionary Computation (CEC). https://doi.org/10.1109/CEC.2016.7748359
bibtex: '@inproceedings{Kerschke_Trautmann_2016, place={Vancouver, BC, Kanada},
title={The R-Package FLACCO for Exploratory Landscape Analysis with Applications
to Multi-Objective Optimization Problems}, DOI={10.1109/CEC.2016.7748359},
booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)},
author={Kerschke, Pascal and Trautmann, Heike}, year={2016} }'
chicago: Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory
Landscape Analysis with Applications to Multi-Objective Optimization Problems.”
In Proceedings of the IEEE Congress on Evolutionary Computation (CEC).
Vancouver, BC, Kanada, 2016. https://doi.org/10.1109/CEC.2016.7748359.
ieee: 'P. Kerschke and H. Trautmann, “The R-Package FLACCO for Exploratory Landscape
Analysis with Applications to Multi-Objective Optimization Problems,” 2016, doi:
10.1109/CEC.2016.7748359.'
mla: Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory
Landscape Analysis with Applications to Multi-Objective Optimization Problems.”
Proceedings of the IEEE Congress on Evolutionary Computation (CEC), 2016,
doi:10.1109/CEC.2016.7748359.
short: 'P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary
Computation (CEC), Vancouver, BC, Kanada, 2016.'
date_created: 2023-08-04T15:14:52Z
date_updated: 2023-10-16T13:39:06Z
department:
- _id: '34'
- _id: '819'
doi: 10.1109/CEC.2016.7748359
language:
- iso: eng
place: Vancouver, BC, Kanada
publication: Proceedings of the IEEE Congress on Evolutionary Computation (CEC)
status: public
title: The R-Package FLACCO for Exploratory Landscape Analysis with Applications to
Multi-Objective Optimization Problems
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '46370'
abstract:
- lang: eng
text: This report documents the talks and discussions at the Dagstuhl Seminar 15211
"Theory of Evolutionary Algorithms". This seminar, now in its 8th edition, is
the main meeting point of the highly active theory of randomized search heuristics
subcommunities in Australia, Asia, North America, and Europe. Topics intensively
discussed include rigorous runtime analysis and computational complexity theory
for randomised search heuristics, information geometry of randomised search, and
synergies between the theory of evolutionary algorithms and theories of natural
evolution.
author:
- first_name: F
full_name: Neumann, F
last_name: Neumann
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Neumann F, Trautmann H. Working Group Report: Bridging the Gap Between Experiments
and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms
(Dagstuhl Seminar 15211). Dagstuhl Reports. 2016;5(5):78–79. doi:10.4230/DagRep.5.5.57'
apa: 'Neumann, F., & Trautmann, H. (2016). Working Group Report: Bridging the
Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory
of Evolutionary Algorithms (Dagstuhl Seminar 15211). Dagstuhl Reports,
5(5), 78–79. https://doi.org/10.4230/DagRep.5.5.57'
bibtex: '@article{Neumann_Trautmann_2016, title={Working Group Report: Bridging
the Gap Between Experiments and Theory Using Feature-Based Run-Time Analysis;
Theory of Evolutionary Algorithms (Dagstuhl Seminar 15211)}, volume={5}, DOI={10.4230/DagRep.5.5.57}, number={5},
journal={Dagstuhl Reports}, author={Neumann, F and Trautmann, Heike}, year={2016},
pages={78–79} }'
chicago: 'Neumann, F, and Heike Trautmann. “Working Group Report: Bridging the Gap
Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of
Evolutionary Algorithms (Dagstuhl Seminar 15211).” Dagstuhl Reports 5,
no. 5 (2016): 78–79. https://doi.org/10.4230/DagRep.5.5.57.'
ieee: 'F. Neumann and H. Trautmann, “Working Group Report: Bridging the Gap Between
Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of Evolutionary
Algorithms (Dagstuhl Seminar 15211),” Dagstuhl Reports, vol. 5, no. 5,
pp. 78–79, 2016, doi: 10.4230/DagRep.5.5.57.'
mla: 'Neumann, F., and Heike Trautmann. “Working Group Report: Bridging the Gap
Between Experiments and Theory Using Feature-Based Run-Time Analysis; Theory of
Evolutionary Algorithms (Dagstuhl Seminar 15211).” Dagstuhl Reports, vol.
5, no. 5, 2016, pp. 78–79, doi:10.4230/DagRep.5.5.57.'
short: F. Neumann, H. Trautmann, Dagstuhl Reports 5 (2016) 78–79.
date_created: 2023-08-04T15:17:00Z
date_updated: 2023-10-16T13:40:00Z
department:
- _id: '34'
- _id: '819'
doi: 10.4230/DagRep.5.5.57
intvolume: ' 5'
issue: '5'
language:
- iso: eng
page: 78–79
publication: Dagstuhl Reports
status: public
title: 'Working Group Report: Bridging the Gap Between Experiments and Theory Using
Feature-Based Run-Time Analysis; Theory of Evolutionary Algorithms (Dagstuhl Seminar
15211)'
type: journal_article
user_id: '15504'
volume: 5
year: '2016'
...
---
_id: '48309'
author:
- first_name: Ivan
full_name: Habernal, Ivan
id: '101881'
last_name: Habernal
- first_name: Iryna
full_name: Gurevych, Iryna
last_name: Gurevych
citation:
ama: 'Habernal I, Gurevych I. What makes a convincing argument? Empirical analysis
and detecting attributes of convincingness in Web argumentation. In:
Proceedings of the 2016 Conference on Empirical Methods in Natural
Language Processing. Association for Computational Linguistics; 2016. doi:10.18653/v1/d16-1129'
apa: Habernal, I., & Gurevych, I. (2016). What makes a convincing argument?
Empirical analysis and detecting attributes of convincingness in Web
argumentation. Proceedings of the 2016 Conference on Empirical Methods in Natural
Language Processing. https://doi.org/10.18653/v1/d16-1129
bibtex: '@inproceedings{Habernal_Gurevych_2016, title={What makes a convincing argument?
Empirical analysis and detecting attributes of convincingness in Web
argumentation}, DOI={10.18653/v1/d16-1129},
booktitle={Proceedings of the 2016 Conference on Empirical Methods in Natural
Language Processing}, publisher={Association for Computational Linguistics},
author={Habernal, Ivan and Gurevych, Iryna}, year={2016} }'
chicago: Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument?
Empirical Analysis and Detecting Attributes of Convincingness in Web
Argumentation.” In Proceedings of the 2016 Conference on Empirical Methods
in Natural Language Processing. Association for Computational Linguistics,
2016. https://doi.org/10.18653/v1/d16-1129.
ieee: 'I. Habernal and I. Gurevych, “What makes a convincing argument? Empirical
analysis and detecting attributes of convincingness in Web argumentation,”
2016, doi: 10.18653/v1/d16-1129.'
mla: Habernal, Ivan, and Iryna Gurevych. “What Makes a Convincing Argument? Empirical
Analysis and Detecting Attributes of Convincingness in Web Argumentation.”
Proceedings of the 2016 Conference on Empirical Methods in Natural
Language Processing, Association for Computational Linguistics, 2016, doi:10.18653/v1/d16-1129.
short: 'I. Habernal, I. Gurevych, in: Proceedings of the 2016 Conference on Empirical
Methods in Natural Language Processing, Association for Computational
Linguistics, 2016.'
date_created: 2023-10-19T08:31:58Z
date_updated: 2023-10-19T12:07:05Z
department:
- _id: '34'
- _id: '820'
doi: 10.18653/v1/d16-1129
language:
- iso: eng
publication: Proceedings of the 2016 Conference on Empirical Methods in Natural Language
Processing
publication_status: published
publisher: Association for Computational Linguistics
status: public
title: What makes a convincing argument? Empirical analysis and detecting attributes
of convincingness in Web argumentation
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '48873'
abstract:
- lang: eng
text: Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP)
heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful
in generating satisfactory or even optimal solutions. However, the reasons for
their success are not yet fully understood. Recent approaches take an analytical
viewpoint and try to identify instance features, which make an instance hard or
easy to solve. We contribute to this area by generating instance sets for couples
of TSP algorithms A and B by maximizing/minimizing their performance difference
in order to generate instances which are easier to solve for one solver and much
harder to solve for the other. This instance set offers the potential to identify
key features which allow to distinguish between the problem hardness classes of
both algorithms.
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. Evolving Instances for Maximizing Performance Differences
of State-of-the-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J,
eds. Learning and Intelligent Optimization. Lecture Notes in Computer Science.
Springer International Publishing; 2016:48–59. doi:10.1007/978-3-319-50349-3_4'
apa: Bossek, J., & Trautmann, H. (2016). Evolving Instances for Maximizing Performance
Differences of State-of-the-Art Inexact TSP Solvers. In P. Festa, M. Sellmann,
& J. Vanschoren (Eds.), Learning and Intelligent Optimization (pp.
48–59). Springer International Publishing. https://doi.org/10.1007/978-3-319-50349-3_4
bibtex: '@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes
in Computer Science}, title={Evolving Instances for Maximizing Performance Differences
of State-of-the-Art Inexact TSP Solvers}, DOI={10.1007/978-3-319-50349-3_4},
booktitle={Learning and Intelligent Optimization}, publisher={Springer International
Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, Paola
and Sellmann, Meinolf and Vanschoren, Joaquin}, year={2016}, pages={48–59}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing
Performance Differences of State-of-the-Art Inexact TSP Solvers.” In Learning
and Intelligent Optimization, edited by Paola Festa, Meinolf Sellmann, and
Joaquin Vanschoren, 48–59. Lecture Notes in Computer Science. Cham: Springer International
Publishing, 2016. https://doi.org/10.1007/978-3-319-50349-3_4.'
ieee: 'J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance
Differences of State-of-the-Art Inexact TSP Solvers,” in Learning and Intelligent
Optimization, 2016, pp. 48–59, doi: 10.1007/978-3-319-50349-3_4.'
mla: Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance
Differences of State-of-the-Art Inexact TSP Solvers.” Learning and Intelligent
Optimization, edited by Paola Festa et al., Springer International Publishing,
2016, pp. 48–59, doi:10.1007/978-3-319-50349-3_4.
short: 'J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.),
Learning and Intelligent Optimization, Springer International Publishing, Cham,
2016, pp. 48–59.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:47:05Z
department:
- _id: '819'
doi: 10.1007/978-3-319-50349-3_4
editor:
- first_name: Paola
full_name: Festa, Paola
last_name: Festa
- first_name: Meinolf
full_name: Sellmann, Meinolf
last_name: Sellmann
- first_name: Joaquin
full_name: Vanschoren, Joaquin
last_name: Vanschoren
extern: '1'
keyword:
- Algorithm selection
- Feature selection
- Instance hardness
- TSP
language:
- iso: eng
page: 48–59
place: Cham
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-319-50349-3
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Evolving Instances for Maximizing Performance Differences of State-of-the-Art
Inexact TSP Solvers
type: conference
user_id: '102979'
year: '2016'
...
---
_id: '52803'
author:
- first_name: Stefan
full_name: Borgwardt, Stefan
last_name: Borgwardt
- first_name: Theofilos
full_name: Mailis, Theofilos
last_name: Mailis
- first_name: Rafael
full_name: Peñaloza, Rafael
last_name: Peñaloza
- first_name: Anni-Yasmin
full_name: Turhan, Anni-Yasmin
id: '104470'
last_name: Turhan
citation:
ama: Borgwardt S, Mailis T, Peñaloza R, Turhan A-Y. Answering Fuzzy Conjunctive
Queries Over Finitely Valued Fuzzy Ontologies. Journal on Data Semantics.
2016;5(2):55-75. doi:10.1007/s13740-015-0055-y
apa: Borgwardt, S., Mailis, T., Peñaloza, R., & Turhan, A.-Y. (2016). Answering
Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies. Journal on
Data Semantics, 5(2), 55–75. https://doi.org/10.1007/s13740-015-0055-y
bibtex: '@article{Borgwardt_Mailis_Peñaloza_Turhan_2016, title={Answering Fuzzy
Conjunctive Queries Over Finitely Valued Fuzzy Ontologies}, volume={5}, DOI={10.1007/s13740-015-0055-y},
number={2}, journal={Journal on Data Semantics}, publisher={Springer Science and
Business Media LLC}, author={Borgwardt, Stefan and Mailis, Theofilos and Peñaloza,
Rafael and Turhan, Anni-Yasmin}, year={2016}, pages={55–75} }'
chicago: 'Borgwardt, Stefan, Theofilos Mailis, Rafael Peñaloza, and Anni-Yasmin
Turhan. “Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies.”
Journal on Data Semantics 5, no. 2 (2016): 55–75. https://doi.org/10.1007/s13740-015-0055-y.'
ieee: 'S. Borgwardt, T. Mailis, R. Peñaloza, and A.-Y. Turhan, “Answering Fuzzy
Conjunctive Queries Over Finitely Valued Fuzzy Ontologies,” Journal on Data
Semantics, vol. 5, no. 2, pp. 55–75, 2016, doi: 10.1007/s13740-015-0055-y.'
mla: Borgwardt, Stefan, et al. “Answering Fuzzy Conjunctive Queries Over Finitely
Valued Fuzzy Ontologies.” Journal on Data Semantics, vol. 5, no. 2, Springer
Science and Business Media LLC, 2016, pp. 55–75, doi:10.1007/s13740-015-0055-y.
short: S. Borgwardt, T. Mailis, R. Peñaloza, A.-Y. Turhan, Journal on Data Semantics
5 (2016) 55–75.
date_created: 2024-03-25T09:23:39Z
date_updated: 2024-03-25T13:50:33Z
department:
- _id: '888'
doi: 10.1007/s13740-015-0055-y
intvolume: ' 5'
issue: '2'
keyword:
- Artificial Intelligence
- Computer Networks and Communications
- Information Systems
language:
- iso: eng
page: 55-75
publication: Journal on Data Semantics
publication_identifier:
issn:
- 1861-2032
- 1861-2040
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Answering Fuzzy Conjunctive Queries Over Finitely Valued Fuzzy Ontologies
type: journal_article
user_id: '9503'
volume: 5
year: '2016'
...
---
_id: '47240'
author:
- first_name: Yasemin
full_name: Acar, Yasemin
id: '94636'
last_name: Acar
- first_name: Michael
full_name: Backes, Michael
last_name: Backes
- first_name: Sven
full_name: Bugiel, Sven
last_name: Bugiel
- first_name: Sascha
full_name: Fahl, Sascha
last_name: Fahl
- first_name: Patrick
full_name: McDaniel, Patrick
last_name: McDaniel
- first_name: Matthew
full_name: Smith, Matthew
last_name: Smith
citation:
ama: 'Acar Y, Backes M, Bugiel S, Fahl S, McDaniel P, Smith M. SoK: Lessons Learned
from Android Security Research for Appified Software Platforms. In: 2016 IEEE
Symposium on Security and Privacy (SP). IEEE; 2016. doi:10.1109/sp.2016.33'
apa: 'Acar, Y., Backes, M., Bugiel, S., Fahl, S., McDaniel, P., & Smith, M.
(2016). SoK: Lessons Learned from Android Security Research for Appified Software
Platforms. 2016 IEEE Symposium on Security and Privacy (SP). https://doi.org/10.1109/sp.2016.33'
bibtex: '@inproceedings{Acar_Backes_Bugiel_Fahl_McDaniel_Smith_2016, title={SoK:
Lessons Learned from Android Security Research for Appified Software Platforms},
DOI={10.1109/sp.2016.33}, booktitle={2016
IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Acar,
Yasemin and Backes, Michael and Bugiel, Sven and Fahl, Sascha and McDaniel, Patrick
and Smith, Matthew}, year={2016} }'
chicago: 'Acar, Yasemin, Michael Backes, Sven Bugiel, Sascha Fahl, Patrick McDaniel,
and Matthew Smith. “SoK: Lessons Learned from Android Security Research for Appified
Software Platforms.” In 2016 IEEE Symposium on Security and Privacy (SP).
IEEE, 2016. https://doi.org/10.1109/sp.2016.33.'
ieee: 'Y. Acar, M. Backes, S. Bugiel, S. Fahl, P. McDaniel, and M. Smith, “SoK:
Lessons Learned from Android Security Research for Appified Software Platforms,”
2016, doi: 10.1109/sp.2016.33.'
mla: 'Acar, Yasemin, et al. “SoK: Lessons Learned from Android Security Research
for Appified Software Platforms.” 2016 IEEE Symposium on Security and Privacy
(SP), IEEE, 2016, doi:10.1109/sp.2016.33.'
short: 'Y. Acar, M. Backes, S. Bugiel, S. Fahl, P. McDaniel, M. Smith, in: 2016
IEEE Symposium on Security and Privacy (SP), IEEE, 2016.'
date_created: 2023-09-22T12:41:43Z
date_updated: 2024-06-05T13:14:55Z
department:
- _id: '34'
- _id: '858'
doi: 10.1109/sp.2016.33
extern: '1'
language:
- iso: eng
publication: 2016 IEEE Symposium on Security and Privacy (SP)
publication_status: published
publisher: IEEE
status: public
title: 'SoK: Lessons Learned from Android Security Research for Appified Software
Platforms'
type: conference
user_id: '14931'
year: '2016'
...
---
_id: '47239'
author:
- first_name: Sergej
full_name: Dechand, Sergej
last_name: Dechand
- first_name: Dominik
full_name: Schürmann, Dominik
last_name: Schürmann
- first_name: Karoline
full_name: Busse, Karoline
last_name: Busse
- first_name: Yasemin
full_name: Acar, Yasemin
id: '94636'
last_name: Acar
- first_name: Sascha
full_name: Fahl, Sascha
last_name: Fahl
- first_name: Matthew
full_name: Smith, Matthew
last_name: Smith
citation:
ama: 'Dechand S, Schürmann D, Busse K, Acar Y, Fahl S, Smith M. An Empirical Study
of Textual Key-Fingerprint Representations. In: Holz T, Savage S, eds. 25th
USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12,
2016. USENIX Association; 2016:193–208.'
apa: Dechand, S., Schürmann, D., Busse, K., Acar, Y., Fahl, S., & Smith, M.
(2016). An Empirical Study of Textual Key-Fingerprint Representations. In T. Holz
& S. Savage (Eds.), 25th USENIX Security Symposium, USENIX Security 16,
Austin, TX, USA, August 10-12, 2016 (pp. 193–208). USENIX Association.
bibtex: '@inproceedings{Dechand_Schürmann_Busse_Acar_Fahl_Smith_2016, title={An
Empirical Study of Textual Key-Fingerprint Representations}, booktitle={25th USENIX
Security Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016},
publisher={USENIX Association}, author={Dechand, Sergej and Schürmann, Dominik
and Busse, Karoline and Acar, Yasemin and Fahl, Sascha and Smith, Matthew}, editor={Holz,
Thorsten and Savage, Stefan}, year={2016}, pages={193–208} }'
chicago: Dechand, Sergej, Dominik Schürmann, Karoline Busse, Yasemin Acar, Sascha
Fahl, and Matthew Smith. “An Empirical Study of Textual Key-Fingerprint Representations.”
In 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August
10-12, 2016, edited by Thorsten Holz and Stefan Savage, 193–208. USENIX Association,
2016.
ieee: S. Dechand, D. Schürmann, K. Busse, Y. Acar, S. Fahl, and M. Smith, “An Empirical
Study of Textual Key-Fingerprint Representations,” in 25th USENIX Security
Symposium, USENIX Security 16, Austin, TX, USA, August 10-12, 2016, 2016,
pp. 193–208.
mla: Dechand, Sergej, et al. “An Empirical Study of Textual Key-Fingerprint Representations.”
25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, August
10-12, 2016, edited by Thorsten Holz and Stefan Savage, USENIX Association,
2016, pp. 193–208.
short: 'S. Dechand, D. Schürmann, K. Busse, Y. Acar, S. Fahl, M. Smith, in: T. Holz,
S. Savage (Eds.), 25th USENIX Security Symposium, USENIX Security 16, Austin,
TX, USA, August 10-12, 2016, USENIX Association, 2016, pp. 193–208.'
date_created: 2023-09-22T12:40:35Z
date_updated: 2024-06-05T13:15:58Z
department:
- _id: '34'
- _id: '858'
editor:
- first_name: Thorsten
full_name: Holz, Thorsten
last_name: Holz
- first_name: Stefan
full_name: Savage, Stefan
last_name: Savage
extern: '1'
language:
- iso: eng
page: 193–208
publication: 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA,
August 10-12, 2016
publisher: USENIX Association
status: public
title: An Empirical Study of Textual Key-Fingerprint Representations
type: conference
user_id: '14931'
year: '2016'
...
---
_id: '47241'
author:
- first_name: Yasemin
full_name: Acar, Yasemin
id: '94636'
last_name: Acar
- first_name: Michael
full_name: Backes, Michael
last_name: Backes
- first_name: Sascha
full_name: Fahl, Sascha
last_name: Fahl
- first_name: Doowon
full_name: Kim, Doowon
last_name: Kim
- first_name: Michelle L.
full_name: Mazurek, Michelle L.
last_name: Mazurek
- first_name: Christian
full_name: Stransky, Christian
last_name: Stransky
citation:
ama: 'Acar Y, Backes M, Fahl S, Kim D, Mazurek ML, Stransky C. You Get Where You’re
Looking for: The Impact of Information Sources on Code Security. In: 2016 IEEE
Symposium on Security and Privacy (SP). IEEE; 2016. doi:10.1109/sp.2016.25'
apa: 'Acar, Y., Backes, M., Fahl, S., Kim, D., Mazurek, M. L., & Stransky, C.
(2016). You Get Where You’re Looking for: The Impact of Information Sources on
Code Security. 2016 IEEE Symposium on Security and Privacy (SP). https://doi.org/10.1109/sp.2016.25'
bibtex: '@inproceedings{Acar_Backes_Fahl_Kim_Mazurek_Stransky_2016, title={You Get
Where You’re Looking for: The Impact of Information Sources on Code Security},
DOI={10.1109/sp.2016.25}, booktitle={2016
IEEE Symposium on Security and Privacy (SP)}, publisher={IEEE}, author={Acar,
Yasemin and Backes, Michael and Fahl, Sascha and Kim, Doowon and Mazurek, Michelle
L. and Stransky, Christian}, year={2016} }'
chicago: 'Acar, Yasemin, Michael Backes, Sascha Fahl, Doowon Kim, Michelle L. Mazurek,
and Christian Stransky. “You Get Where You’re Looking for: The Impact of Information
Sources on Code Security.” In 2016 IEEE Symposium on Security and Privacy (SP).
IEEE, 2016. https://doi.org/10.1109/sp.2016.25.'
ieee: 'Y. Acar, M. Backes, S. Fahl, D. Kim, M. L. Mazurek, and C. Stransky, “You
Get Where You’re Looking for: The Impact of Information Sources on Code Security,”
2016, doi: 10.1109/sp.2016.25.'
mla: 'Acar, Yasemin, et al. “You Get Where You’re Looking for: The Impact of Information
Sources on Code Security.” 2016 IEEE Symposium on Security and Privacy (SP),
IEEE, 2016, doi:10.1109/sp.2016.25.'
short: 'Y. Acar, M. Backes, S. Fahl, D. Kim, M.L. Mazurek, C. Stransky, in: 2016
IEEE Symposium on Security and Privacy (SP), IEEE, 2016.'
date_created: 2023-09-22T12:42:01Z
date_updated: 2024-06-05T13:15:19Z
department:
- _id: '34'
- _id: '858'
doi: 10.1109/sp.2016.25
extern: '1'
language:
- iso: eng
publication: 2016 IEEE Symposium on Security and Privacy (SP)
publication_status: published
publisher: IEEE
status: public
title: 'You Get Where You''re Looking for: The Impact of Information Sources on Code
Security'
type: conference
user_id: '14931'
year: '2016'
...
---
_id: '46365'
abstract:
- lang: eng
text: Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP)
heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful
in generating satisfactory or even optimal solutions. However, the reasons for
their success are not yet fully understood. Recent approaches take an analytical
viewpoint and try to identify instance features, which make an instance hard or
easy to solve. We contribute to this area by generating instance sets for couples
of TSP algorithms A and B by maximizing/minimizing their performance difference
in order to generate instances which are easier to solve for one solver and much
harder to solve for the other. This instance set offers the potential to identify
key features which allow to distinguish between the problem hardness classes of
both algorithms.
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. Evolving Instances for Maximizing Performance Differences
of State-of-The-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J,
eds. Learning and Intelligent Optimization. Vol 10079. Lecture Notes in
Computer Science. Springer International Publishing; 2016:48–59. doi:10.1007/978-3-319-50349-3_4'
apa: Bossek, J., & Trautmann, H. (2016). Evolving Instances for Maximizing Performance
Differences of State-of-The-Art Inexact TSP Solvers. In P. Festa, M. Sellmann,
& J. Vanschoren (Eds.), Learning and Intelligent Optimization (Vol.
10079, pp. 48–59). Springer International Publishing. https://doi.org/10.1007/978-3-319-50349-3_4
bibtex: '@inproceedings{Bossek_Trautmann_2016, place={Ischia, Italy}, series={Lecture
Notes in Computer Science}, title={Evolving Instances for Maximizing Performance
Differences of State-of-The-Art Inexact TSP Solvers}, volume={10079}, DOI={10.1007/978-3-319-50349-3_4},
booktitle={Learning and Intelligent Optimization}, publisher={Springer International
Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, P and
Sellmann, M and Vanschoren, J}, year={2016}, pages={48–59}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing
Performance Differences of State-of-The-Art Inexact TSP Solvers.” In Learning
and Intelligent Optimization, edited by P Festa, M Sellmann, and J Vanschoren,
10079:48–59. Lecture Notes in Computer Science. Ischia, Italy: Springer International
Publishing, 2016. https://doi.org/10.1007/978-3-319-50349-3_4.'
ieee: 'J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance
Differences of State-of-The-Art Inexact TSP Solvers,” in Learning and Intelligent
Optimization, 2016, vol. 10079, pp. 48–59, doi: 10.1007/978-3-319-50349-3_4.'
mla: Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance
Differences of State-of-The-Art Inexact TSP Solvers.” Learning and Intelligent
Optimization, edited by P Festa et al., vol. 10079, Springer International
Publishing, 2016, pp. 48–59, doi:10.1007/978-3-319-50349-3_4.
short: 'J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.),
Learning and Intelligent Optimization, Springer International Publishing, Ischia,
Italy, 2016, pp. 48–59.'
date_created: 2023-08-04T15:10:58Z
date_updated: 2024-06-10T11:58:25Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-50349-3_4
editor:
- first_name: P
full_name: Festa, P
last_name: Festa
- first_name: M
full_name: Sellmann, M
last_name: Sellmann
- first_name: J
full_name: Vanschoren, J
last_name: Vanschoren
intvolume: ' 10079'
language:
- iso: eng
page: 48–59
place: Ischia, Italy
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-319-50348-6
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Evolving Instances for Maximizing Performance Differences of State-of-The-Art
Inexact TSP Solvers
type: conference
user_id: '15504'
volume: 10079
year: '2016'
...
---
_id: '46366'
abstract:
- lang: eng
text: State of the Art inexact solvers of the NP-hard Traveling Salesperson Problem
(TSP) are known to mostly yield high-quality solutions in reasonable computation
times. With the purpose of understanding different levels of instance difficulties,
instances for the current State of the Art heuristic TSP solvers LKH+restart and
EAX+restart are presented which are evolved using a sophisticated evolutionary
algorithm. More specifically, the performance differences of the respective solvers
are maximized resulting in instances which are easier to solve for one solver
and much more difficult for the other. Focusing on both optimization directions,
instance features are identified which characterize both types of instances and
increase the understanding of solver performance differences.
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. Understanding Characteristics of Evolved Instances
for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.
In: Adorni G, Cagnoni S, Gori M, Maratea M, eds. AI*IA 2016 Advances in Artificial
Intelligence. Vol 10037. Lecture Notes in Computer Science. Springer; 2016:3–12.
doi:10.1007/978-3-319-49130-1_1'
apa: Bossek, J., & Trautmann, H. (2016). Understanding Characteristics of Evolved
Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.
In G. Adorni, S. Cagnoni, M. Gori, & M. Maratea (Eds.), AI*IA 2016 Advances
in Artificial Intelligence (Vol. 10037, pp. 3–12). Springer. https://doi.org/10.1007/978-3-319-49130-1_1
bibtex: '@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes
in Computer Science}, title={Understanding Characteristics of Evolved Instances
for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference},
volume={10037}, DOI={10.1007/978-3-319-49130-1_1},
booktitle={AI*IA 2016 Advances in Artificial Intelligence}, publisher={Springer},
author={Bossek, Jakob and Trautmann, Heike}, editor={Adorni, G and Cagnoni, S
and Gori, M and Maratea, M}, year={2016}, pages={3–12}, collection={Lecture Notes
in Computer Science} }'
chicago: 'Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of
Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance
Difference.” In AI*IA 2016 Advances in Artificial Intelligence, edited
by G Adorni, S Cagnoni, M Gori, and M Maratea, 10037:3–12. Lecture Notes in Computer
Science. Cham: Springer, 2016. https://doi.org/10.1007/978-3-319-49130-1_1.'
ieee: 'J. Bossek and H. Trautmann, “Understanding Characteristics of Evolved Instances
for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference,”
in AI*IA 2016 Advances in Artificial Intelligence, 2016, vol. 10037, pp.
3–12, doi: 10.1007/978-3-319-49130-1_1.'
mla: Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of Evolved
Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.”
AI*IA 2016 Advances in Artificial Intelligence, edited by G Adorni et al.,
vol. 10037, Springer, 2016, pp. 3–12, doi:10.1007/978-3-319-49130-1_1.
short: 'J. Bossek, H. Trautmann, in: G. Adorni, S. Cagnoni, M. Gori, M. Maratea
(Eds.), AI*IA 2016 Advances in Artificial Intelligence, Springer, Cham, 2016,
pp. 3–12.'
date_created: 2023-08-04T15:11:47Z
date_updated: 2024-06-10T11:58:12Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-49130-1_1
editor:
- first_name: G
full_name: Adorni, G
last_name: Adorni
- first_name: S
full_name: Cagnoni, S
last_name: Cagnoni
- first_name: M
full_name: Gori, M
last_name: Gori
- first_name: M
full_name: Maratea, M
last_name: Maratea
intvolume: ' 10037'
language:
- iso: eng
page: 3–12
place: Cham
publication: AI*IA 2016 Advances in Artificial Intelligence
publication_identifier:
isbn:
- 978-3-319-49129-5
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact
TSP Solvers with Maximum Performance Difference
type: conference
user_id: '15504'
volume: 10037
year: '2016'
...
---
_id: '8159'
abstract:
- lang: eng
text: The Boolean constraint satisfaction problem 3-SAT is arguably the canonical
NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial
time, but in fact in deterministic linear time. In 2006, Bravyi proposed a physically
motivated generalization of k-SAT to the quantum setting, defining the problem
"quantum k-SAT". He showed that quantum 2-SAT is also solvable in polynomial time
on a classical computer, in particular in deterministic time O(n^4), assuming
unit-cost arithmetic over a field extension of the rational numbers, where n is
number of variables. In this paper, we present an algorithm for quantum 2-SAT
which runs in linear time, i.e. deterministic time O(n+m) for n and m the number
of variables and clauses, respectively. Our approach exploits the transfer matrix
techniques of Laumann et al. [QIC, 2010] used in the study of phase transitions
for random quantum 2-SAT, and bears similarities with both the linear time 2-SAT
algorithms of Even, Itai, and Shamir (based on backtracking) [SICOMP, 1976] and
Aspvall, Plass, and Tarjan (based on strongly connected components) [IPL, 1979].
author:
- first_name: Niel
full_name: de Beaudrap, Niel
last_name: de Beaudrap
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
citation:
ama: 'de Beaudrap N, Gharibian S. A Linear Time Algorithm for Quantum 2-SAT. In:
Raz R, ed. Proceedings of the 31st Conference on Computational Complexity (CCC
2016). Vol 50. Leibniz International Proceedings in Informatics (LIPIcs).
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; 2016:27:1-17:21. doi:10.4230/LIPIcs.CCC.2016.27'
apa: de Beaudrap, N., & Gharibian, S. (2016). A Linear Time Algorithm for Quantum
2-SAT. In R. Raz (Ed.), Proceedings of the 31st Conference on Computational
Complexity (CCC 2016) (Vol. 50, p. 27:1-17:21). Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik. https://doi.org/10.4230/LIPIcs.CCC.2016.27
bibtex: '@inproceedings{de Beaudrap_Gharibian_2016, place={Dagstuhl, Germany}, series={Leibniz
International Proceedings in Informatics (LIPIcs)}, title={A Linear Time Algorithm
for Quantum 2-SAT}, volume={50}, DOI={10.4230/LIPIcs.CCC.2016.27},
booktitle={Proceedings of the 31st Conference on Computational Complexity (CCC
2016)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}, author={de
Beaudrap, Niel and Gharibian, Sevag}, editor={Raz, Ran}, year={2016}, pages={27:1–17:21},
collection={Leibniz International Proceedings in Informatics (LIPIcs)} }'
chicago: 'Beaudrap, Niel de, and Sevag Gharibian. “A Linear Time Algorithm for Quantum
2-SAT.” In Proceedings of the 31st Conference on Computational Complexity (CCC
2016), edited by Ran Raz, 50:27:1-17:21. Leibniz International Proceedings
in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, 2016. https://doi.org/10.4230/LIPIcs.CCC.2016.27.'
ieee: 'N. de Beaudrap and S. Gharibian, “A Linear Time Algorithm for Quantum 2-SAT,”
in Proceedings of the 31st Conference on Computational Complexity (CCC 2016),
Tokyo, Japan, 2016, vol. 50, p. 27:1–17:21, doi: 10.4230/LIPIcs.CCC.2016.27.'
mla: de Beaudrap, Niel, and Sevag Gharibian. “A Linear Time Algorithm for Quantum
2-SAT.” Proceedings of the 31st Conference on Computational Complexity (CCC
2016), edited by Ran Raz, vol. 50, Schloss Dagstuhl - Leibniz-Zentrum fuer
Informatik, 2016, p. 27:1-17:21, doi:10.4230/LIPIcs.CCC.2016.27.
short: 'N. de Beaudrap, S. Gharibian, in: R. Raz (Ed.), Proceedings of the 31st
Conference on Computational Complexity (CCC 2016), Schloss Dagstuhl - Leibniz-Zentrum
fuer Informatik, Dagstuhl, Germany, 2016, p. 27:1–17:21.'
conference:
location: Tokyo, Japan
name: 31st Conference on Computational Complexity (CCC 2016)
date_created: 2019-03-01T11:19:54Z
date_updated: 2023-02-28T11:01:53Z
department:
- _id: '623'
- _id: '7'
doi: 10.4230/LIPIcs.CCC.2016.27
editor:
- first_name: Ran
full_name: Raz, Ran
last_name: Raz
extern: '1'
external_id:
arxiv:
- '1508.07338'
intvolume: ' 50'
keyword:
- quantum 2-SAT
- transfer matrix
- strongly connected components
- limited backtracking
- local Hamiltonian
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://drops.dagstuhl.de/opus/volltexte/2016/5836/
oa: '1'
page: 27:1-17:21
place: Dagstuhl, Germany
publication: Proceedings of the 31st Conference on Computational Complexity (CCC 2016)
publication_identifier:
isbn:
- 978-3-95977-008-8
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: A Linear Time Algorithm for Quantum 2-SAT
type: conference
user_id: '71541'
volume: 50
year: '2016'
...
---
_id: '29'
abstract:
- lang: eng
text: In this chapter, we present an introduction to the ReconOS operating system
for reconfigurable computing. ReconOS offers a unified multi-threaded programming
model and operating system services for threads executing in software and threads
mapped to reconfigurable hardware. By supporting standard POSIX operating system
functions for both software and hardware threads, ReconOS particularly caters
to developers with a software background, because developers can use well-known
mechanisms such as semaphores, mutexes, condition variables, and message queues
for developing hybrid applications with threads running on the CPU and FPGA concurrently.
Through the semantic integration of hardware accelerators into a standard operating
system environment, ReconOS allows for rapid design space exploration, supports
a structured application development process and improves the portability of applications
between different reconfigurable computing systems.
author:
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Enno
full_name: Lübbers, Enno
last_name: Lübbers
citation:
ama: 'Agne A, Platzner M, Plessl C, Happe M, Lübbers E. ReconOS. In: Koch D, Hannig
F, Ziener D, eds. FPGAs for Software Programmers. Springer International
Publishing; 2016:227-244. doi:10.1007/978-3-319-26408-0_13'
apa: Agne, A., Platzner, M., Plessl, C., Happe, M., & Lübbers, E. (2016). ReconOS.
In D. Koch, F. Hannig, & D. Ziener (Eds.), FPGAs for Software Programmers
(pp. 227–244). Springer International Publishing. https://doi.org/10.1007/978-3-319-26408-0_13
bibtex: '@inbook{Agne_Platzner_Plessl_Happe_Lübbers_2016, place={Cham}, title={ReconOS},
DOI={10.1007/978-3-319-26408-0_13},
booktitle={FPGAs for Software Programmers}, publisher={Springer International
Publishing}, author={Agne, Andreas and Platzner, Marco and Plessl, Christian and
Happe, Markus and Lübbers, Enno}, editor={Koch, Dirk and Hannig, Frank and Ziener,
Daniel}, year={2016}, pages={227–244} }'
chicago: 'Agne, Andreas, Marco Platzner, Christian Plessl, Markus Happe, and Enno
Lübbers. “ReconOS.” In FPGAs for Software Programmers, edited by Dirk Koch,
Frank Hannig, and Daniel Ziener, 227–44. Cham: Springer International Publishing,
2016. https://doi.org/10.1007/978-3-319-26408-0_13.'
ieee: 'A. Agne, M. Platzner, C. Plessl, M. Happe, and E. Lübbers, “ReconOS,” in
FPGAs for Software Programmers, D. Koch, F. Hannig, and D. Ziener, Eds.
Cham: Springer International Publishing, 2016, pp. 227–244.'
mla: Agne, Andreas, et al. “ReconOS.” FPGAs for Software Programmers, edited
by Dirk Koch et al., Springer International Publishing, 2016, pp. 227–44, doi:10.1007/978-3-319-26408-0_13.
short: 'A. Agne, M. Platzner, C. Plessl, M. Happe, E. Lübbers, in: D. Koch, F. Hannig,
D. Ziener (Eds.), FPGAs for Software Programmers, Springer International Publishing,
Cham, 2016, pp. 227–244.'
date_created: 2017-07-26T15:07:06Z
date_updated: 2023-09-26T13:25:38Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1007/978-3-319-26408-0_13
editor:
- first_name: Dirk
full_name: Koch, Dirk
last_name: Koch
- first_name: Frank
full_name: Hannig, Frank
last_name: Hannig
- first_name: Daniel
full_name: Ziener, Daniel
last_name: Ziener
language:
- iso: eng
page: 227-244
place: Cham
project:
- _id: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: FPGAs for Software Programmers
publication_identifier:
isbn:
- 978-3-319-26406-6
- 978-3-319-26408-0
publication_status: published
publisher: Springer International Publishing
quality_controlled: '1'
status: public
title: ReconOS
type: book_chapter
user_id: '15278'
year: '2016'
...
---
_id: '31'
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Ettore M. G.
full_name: Trainiti, Ettore M. G.
last_name: Trainiti
- first_name: Gianluca C.
full_name: Durelli, Gianluca C.
last_name: Durelli
- first_name: Cristiana
full_name: Bolchini, Cristiana
last_name: Bolchini
citation:
ama: 'Riebler H, Vaz GF, Plessl C, Trainiti EMG, Durelli GC, Bolchini C. Using Just-in-Time
Code Generation for Transparent Resource Management in Heterogeneous Systems.
In: Proc. HiPEAC Workshop on Reonfigurable Computing (WRC). ; 2016.'
apa: Riebler, H., Vaz, G. F., Plessl, C., Trainiti, E. M. G., Durelli, G. C., &
Bolchini, C. (2016). Using Just-in-Time Code Generation for Transparent Resource
Management in Heterogeneous Systems. Proc. HiPEAC Workshop on Reonfigurable
Computing (WRC).
bibtex: '@inproceedings{Riebler_Vaz_Plessl_Trainiti_Durelli_Bolchini_2016, title={Using
Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous
Systems}, booktitle={Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)},
author={Riebler, Heinrich and Vaz, Gavin Francis and Plessl, Christian and Trainiti,
Ettore M. G. and Durelli, Gianluca C. and Bolchini, Cristiana}, year={2016} }'
chicago: Riebler, Heinrich, Gavin Francis Vaz, Christian Plessl, Ettore M. G. Trainiti,
Gianluca C. Durelli, and Cristiana Bolchini. “Using Just-in-Time Code Generation
for Transparent Resource Management in Heterogeneous Systems.” In Proc. HiPEAC
Workshop on Reonfigurable Computing (WRC), 2016.
ieee: H. Riebler, G. F. Vaz, C. Plessl, E. M. G. Trainiti, G. C. Durelli, and C.
Bolchini, “Using Just-in-Time Code Generation for Transparent Resource Management
in Heterogeneous Systems,” 2016.
mla: Riebler, Heinrich, et al. “Using Just-in-Time Code Generation for Transparent
Resource Management in Heterogeneous Systems.” Proc. HiPEAC Workshop on Reonfigurable
Computing (WRC), 2016.
short: 'H. Riebler, G.F. Vaz, C. Plessl, E.M.G. Trainiti, G.C. Durelli, C. Bolchini,
in: Proc. HiPEAC Workshop on Reonfigurable Computing (WRC), 2016.'
date_created: 2017-07-26T15:16:31Z
date_updated: 2023-09-26T13:25:59Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
file:
- access_level: closed
content_type: application/pdf
creator: deffel
date_created: 2019-01-11T11:56:55Z
date_updated: 2019-01-11T11:56:55Z
file_id: '6626'
file_name: wrc_upb_polimi_final.pdf
file_size: 394563
relation: main_file
success: 1
file_date_updated: 2019-01-11T11:56:55Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subproject C2
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Proc. HiPEAC Workshop on Reonfigurable Computing (WRC)
quality_controlled: '1'
status: public
title: Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous
Systems
type: conference
user_id: '15278'
year: '2016'
...
---
_id: '24'
author:
- first_name: Tobias
full_name: Kenter, Tobias
id: '3145'
last_name: Kenter
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Kenter T, Plessl C. Microdisk Cavity FDTD Simulation on FPGA using OpenCL.
In: Proc. Workshop on Heterogeneous High-Performance Reconfigurable Computing
(H2RC). ; 2016.'
apa: Kenter, T., & Plessl, C. (2016). Microdisk Cavity FDTD Simulation on FPGA
using OpenCL. Proc. Workshop on Heterogeneous High-Performance Reconfigurable
Computing (H2RC).
bibtex: '@inproceedings{Kenter_Plessl_2016, title={Microdisk Cavity FDTD Simulation
on FPGA using OpenCL}, booktitle={Proc. Workshop on Heterogeneous High-performance
Reconfigurable Computing (H2RC)}, author={Kenter, Tobias and Plessl, Christian},
year={2016} }'
chicago: Kenter, Tobias, and Christian Plessl. “Microdisk Cavity FDTD Simulation
on FPGA Using OpenCL.” In Proc. Workshop on Heterogeneous High-Performance
Reconfigurable Computing (H2RC), 2016.
ieee: T. Kenter and C. Plessl, “Microdisk Cavity FDTD Simulation on FPGA using OpenCL,”
2016.
mla: Kenter, Tobias, and Christian Plessl. “Microdisk Cavity FDTD Simulation on
FPGA Using OpenCL.” Proc. Workshop on Heterogeneous High-Performance Reconfigurable
Computing (H2RC), 2016.
short: 'T. Kenter, C. Plessl, in: Proc. Workshop on Heterogeneous High-Performance
Reconfigurable Computing (H2RC), 2016.'
date_created: 2017-07-26T15:00:43Z
date_updated: 2023-09-26T13:26:17Z
ddc:
- '004'
department:
- _id: '27'
- _id: '518'
file:
- access_level: closed
content_type: application/pdf
creator: kenter
date_created: 2018-11-14T12:38:45Z
date_updated: 2018-11-14T12:38:45Z
file_id: '5602'
file_name: paper_26.pdf
file_size: 129552
relation: main_file
success: 1
file_date_updated: 2018-11-14T12:38:45Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '32'
grant_number: PL 595/2-1 / 320898746
name: Performance and Efficiency in HPC with Custom Computing
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subproject C2
publication: Proc. Workshop on Heterogeneous High-performance Reconfigurable Computing
(H2RC)
quality_controlled: '1'
status: public
title: Microdisk Cavity FDTD Simulation on FPGA using OpenCL
type: conference
user_id: '15278'
year: '2016'
...
---
_id: '25'
author:
- first_name: Michael
full_name: Lass, Michael
id: '24135'
last_name: Lass
orcid: 0000-0002-5708-7632
- first_name: Thomas
full_name: Kühne, Thomas
id: '49079'
last_name: Kühne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Lass M, Kühne T, Plessl C. Using Approximate Computing in Scientific Codes.
In: Workshop on Approximate Computing (AC). ; 2016.'
apa: Lass, M., Kühne, T., & Plessl, C. (2016). Using Approximate Computing in
Scientific Codes. Workshop on Approximate Computing (AC).
bibtex: '@inproceedings{Lass_Kühne_Plessl_2016, title={Using Approximate Computing
in Scientific Codes}, booktitle={Workshop on Approximate Computing (AC)}, author={Lass,
Michael and Kühne, Thomas and Plessl, Christian}, year={2016} }'
chicago: Lass, Michael, Thomas Kühne, and Christian Plessl. “Using Approximate Computing
in Scientific Codes.” In Workshop on Approximate Computing (AC), 2016.
ieee: M. Lass, T. Kühne, and C. Plessl, “Using Approximate Computing in Scientific
Codes,” 2016.
mla: Lass, Michael, et al. “Using Approximate Computing in Scientific Codes.” Workshop
on Approximate Computing (AC), 2016.
short: 'M. Lass, T. Kühne, C. Plessl, in: Workshop on Approximate Computing (AC),
2016.'
date_created: 2017-07-26T15:02:20Z
date_updated: 2023-09-26T13:25:17Z
department:
- _id: '27'
- _id: '518'
- _id: '304'
language:
- iso: eng
project:
- _id: '52'
name: Computing Resources Provided by the Paderborn Center for Parallel Computing
publication: Workshop on Approximate Computing (AC)
quality_controlled: '1'
status: public
title: Using Approximate Computing in Scientific Codes
type: conference
user_id: '15278'
year: '2016'
...
---
_id: '138'
abstract:
- lang: eng
text: Hardware accelerators are becoming popular in academia and industry. To move
one step further from the state-of-the-art multicore plus accelerator approaches,
we present in this paper our innovative SAVEHSA architecture. It comprises of
a heterogeneous hardware platform with three different high-end accelerators attached
over PCIe (GPGPU, FPGA and Intel MIC). Such systems can process parallel workloads
very efficiently whilst being more energy efficient than regular CPU systems.
To leverage the heterogeneity, the workload has to be distributed among the computing
units in a way that each unit is well-suited for the assigned task and executable
code must be available. To tackle this problem we present two software components;
the first can perform resource allocation at runtime while respecting system and
application goals (in terms of throughput, energy, latency, etc.) and the second
is able to analyze an application and generate executable code for an accelerator
at runtime. We demonstrate the first proof-of-concept implementation of our framework
on the heterogeneous platform, discuss different runtime policies and measure
the introduced overheads.
author:
- first_name: Heinrich
full_name: Riebler, Heinrich
id: '8961'
last_name: Riebler
- first_name: Gavin Francis
full_name: Vaz, Gavin Francis
id: '30332'
last_name: Vaz
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: 'Ettore M. G. '
full_name: 'Trainiti, Ettore M. G. '
last_name: Trainiti
- first_name: Gianluca C.
full_name: Durelli, Gianluca C.
last_name: Durelli
- first_name: Emanuele
full_name: Del Sozzo, Emanuele
last_name: Del Sozzo
- first_name: 'Marco D. '
full_name: 'Santambrogio, Marco D. '
last_name: Santambrogio
- first_name: Christina
full_name: Bolchini, Christina
last_name: Bolchini
citation:
ama: 'Riebler H, Vaz GF, Plessl C, et al. Using Just-in-Time Code Generation for
Transparent Resource Management in Heterogeneous Systems. In: Proceedings of
International Forum on Research and Technologies for Society and Industry (RTSI).
IEEE; 2016:1-5. doi:10.1109/RTSI.2016.7740545'
apa: Riebler, H., Vaz, G. F., Plessl, C., Trainiti, E. M. G., Durelli, G. C., Del
Sozzo, E., Santambrogio, M. D., & Bolchini, C. (2016). Using Just-in-Time
Code Generation for Transparent Resource Management in Heterogeneous Systems.
Proceedings of International Forum on Research and Technologies for Society
and Industry (RTSI), 1–5. https://doi.org/10.1109/RTSI.2016.7740545
bibtex: '@inproceedings{Riebler_Vaz_Plessl_Trainiti_Durelli_Del Sozzo_Santambrogio_Bolchini_2016,
title={Using Just-in-Time Code Generation for Transparent Resource Management
in Heterogeneous Systems}, DOI={10.1109/RTSI.2016.7740545},
booktitle={Proceedings of International Forum on Research and Technologies for
Society and Industry (RTSI)}, publisher={IEEE}, author={Riebler, Heinrich and
Vaz, Gavin Francis and Plessl, Christian and Trainiti, Ettore M. G. and Durelli,
Gianluca C. and Del Sozzo, Emanuele and Santambrogio, Marco D. and Bolchini,
Christina}, year={2016}, pages={1–5} }'
chicago: Riebler, Heinrich, Gavin Francis Vaz, Christian Plessl, Ettore M. G. Trainiti,
Gianluca C. Durelli, Emanuele Del Sozzo, Marco D. Santambrogio, and Christina
Bolchini. “Using Just-in-Time Code Generation for Transparent Resource Management
in Heterogeneous Systems.” In Proceedings of International Forum on Research
and Technologies for Society and Industry (RTSI), 1–5. IEEE, 2016. https://doi.org/10.1109/RTSI.2016.7740545.
ieee: 'H. Riebler et al., “Using Just-in-Time Code Generation for Transparent
Resource Management in Heterogeneous Systems,” in Proceedings of International
Forum on Research and Technologies for Society and Industry (RTSI), 2016,
pp. 1–5, doi: 10.1109/RTSI.2016.7740545.'
mla: Riebler, Heinrich, et al. “Using Just-in-Time Code Generation for Transparent
Resource Management in Heterogeneous Systems.” Proceedings of International
Forum on Research and Technologies for Society and Industry (RTSI), IEEE,
2016, pp. 1–5, doi:10.1109/RTSI.2016.7740545.
short: 'H. Riebler, G.F. Vaz, C. Plessl, E.M.G. Trainiti, G.C. Durelli, E. Del Sozzo,
M.D. Santambrogio, C. Bolchini, in: Proceedings of International Forum on Research
and Technologies for Society and Industry (RTSI), IEEE, 2016, pp. 1–5.'
date_created: 2017-10-17T12:41:18Z
date_updated: 2023-09-26T13:28:11Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
doi: 10.1109/RTSI.2016.7740545
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-21T13:01:09Z
date_updated: 2018-03-21T13:01:09Z
file_id: '1560'
file_name: 138-07740545.pdf
file_size: 184334
relation: main_file
success: 1
file_date_updated: 2018-03-21T13:01:09Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-5
project:
- _id: '1'
grant_number: '160364472'
name: SFB 901
- _id: '14'
grant_number: '160364472'
name: SFB 901 - Subprojekt C2
- _id: '4'
name: SFB 901 - Project Area C
- _id: '34'
grant_number: '610996'
name: Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous
System Architectures
publication: Proceedings of International Forum on Research and Technologies for Society
and Industry (RTSI)
publisher: IEEE
quality_controlled: '1'
status: public
title: Using Just-in-Time Code Generation for Transparent Resource Management in Heterogeneous
Systems
type: conference
user_id: '15278'
year: '2016'
...