---
_id: '46397'
abstract:
- lang: eng
text: In multiobjective optimization, set-based performance indicators are commonly
used to assess the quality of a Pareto front approximation. Based on the scalarization
obtained by these indicators, a performance comparison of multiobjective optimization
algorithms becomes possible. The R2 and the Hypervolume (HV) indicator represent
two recommended approaches which have shown a correlated behavior in recent empirical
studies. Whereas the HV indicator has been comprehensively analyzed in the last
years, almost no studies on the R2 indicator exist. In this paper, we thus perform
a comprehensive investigation of the properties of the R2 indicator in a theoretical
and empirical way. The influence of the number and distribution of the weight
vectors on the optimal distribution of μ solutions is analyzed. Based on a comparative
analysis, specific characteristics and differences of the R2 and HV indicator
are presented.
author:
- first_name: Dimo
full_name: Brockhoff, Dimo
last_name: Brockhoff
- first_name: Tobias
full_name: Wagner, Tobias
last_name: Wagner
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Brockhoff D, Wagner T, Trautmann H. On the Properties of the R2 Indicator.
In: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation.
GECCO ’12. Association for Computing Machinery; 2012:465–472. doi:10.1145/2330163.2330230'
apa: Brockhoff, D., Wagner, T., & Trautmann, H. (2012). On the Properties of
the R2 Indicator. Proceedings of the 14th Annual Conference on Genetic and
Evolutionary Computation, 465–472. https://doi.org/10.1145/2330163.2330230
bibtex: '@inproceedings{Brockhoff_Wagner_Trautmann_2012, place={New York, NY, USA},
series={GECCO ’12}, title={On the Properties of the R2 Indicator}, DOI={10.1145/2330163.2330230},
booktitle={Proceedings of the 14th Annual Conference on Genetic and Evolutionary
Computation}, publisher={Association for Computing Machinery}, author={Brockhoff,
Dimo and Wagner, Tobias and Trautmann, Heike}, year={2012}, pages={465–472}, collection={GECCO
’12} }'
chicago: 'Brockhoff, Dimo, Tobias Wagner, and Heike Trautmann. “On the Properties
of the R2 Indicator.” In Proceedings of the 14th Annual Conference on Genetic
and Evolutionary Computation, 465–472. GECCO ’12. New York, NY, USA: Association
for Computing Machinery, 2012. https://doi.org/10.1145/2330163.2330230.'
ieee: 'D. Brockhoff, T. Wagner, and H. Trautmann, “On the Properties of the R2 Indicator,”
in Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation,
2012, pp. 465–472, doi: 10.1145/2330163.2330230.'
mla: Brockhoff, Dimo, et al. “On the Properties of the R2 Indicator.” Proceedings
of the 14th Annual Conference on Genetic and Evolutionary Computation, Association
for Computing Machinery, 2012, pp. 465–472, doi:10.1145/2330163.2330230.
short: 'D. Brockhoff, T. Wagner, H. Trautmann, in: Proceedings of the 14th Annual
Conference on Genetic and Evolutionary Computation, Association for Computing
Machinery, New York, NY, USA, 2012, pp. 465–472.'
date_created: 2023-08-04T15:52:42Z
date_updated: 2023-10-16T13:47:23Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2330163.2330230
keyword:
- hypervolume indicator
- multiobjective optimization
- performance assessment
- r2 indicator
language:
- iso: eng
page: 465–472
place: New York, NY, USA
publication: Proceedings of the 14th Annual Conference on Genetic and Evolutionary
Computation
publication_identifier:
isbn:
- '9781450311779'
publisher: Association for Computing Machinery
series_title: GECCO ’12
status: public
title: On the Properties of the R2 Indicator
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '46396'
abstract:
- lang: eng
text: The steady supply of new optimization methods makes the algorithm selection
problem (ASP) an increasingly pressing and challenging task, specially for real-world
black-box optimization problems. The introduced approach considers the ASP as
a cost-sensitive classification task which is based on Exploratory Landscape Analysis.
Low-level features gathered by systematic sampling of the function on the feasible
set are used to predict a well-performing algorithm out of a given portfolio.
Example-specific label costs are defined by the expected runtime of each candidate
algorithm. We use one-sided support vector regression to solve this learning problem.
The approach is illustrated by means of the optimization problems and algorithms
of the BBOB’09/10 workshop.
author:
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Mike
full_name: Preuß, Mike
last_name: Preuß
citation:
ama: 'Bischl B, Mersmann O, Trautmann H, Preuß M. Algorithm Selection Based on Exploratory
Landscape Analysis and Cost-Sensitive Learning. In: Proceedings of the 14th
Annual Conference on Genetic and Evolutionary Computation. GECCO ’12. Association
for Computing Machinery; 2012:313–320. doi:10.1145/2330163.2330209'
apa: Bischl, B., Mersmann, O., Trautmann, H., & Preuß, M. (2012). Algorithm
Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning.
Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation,
313–320. https://doi.org/10.1145/2330163.2330209
bibtex: '@inproceedings{Bischl_Mersmann_Trautmann_Preuß_2012, place={New York, NY,
USA}, series={GECCO ’12}, title={Algorithm Selection Based on Exploratory Landscape
Analysis and Cost-Sensitive Learning}, DOI={10.1145/2330163.2330209},
booktitle={Proceedings of the 14th Annual Conference on Genetic and Evolutionary
Computation}, publisher={Association for Computing Machinery}, author={Bischl,
Bernd and Mersmann, Olaf and Trautmann, Heike and Preuß, Mike}, year={2012}, pages={313–320},
collection={GECCO ’12} }'
chicago: 'Bischl, Bernd, Olaf Mersmann, Heike Trautmann, and Mike Preuß. “Algorithm
Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning.”
In Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation,
313–320. GECCO ’12. New York, NY, USA: Association for Computing Machinery, 2012.
https://doi.org/10.1145/2330163.2330209.'
ieee: 'B. Bischl, O. Mersmann, H. Trautmann, and M. Preuß, “Algorithm Selection
Based on Exploratory Landscape Analysis and Cost-Sensitive Learning,” in Proceedings
of the 14th Annual Conference on Genetic and Evolutionary Computation, 2012,
pp. 313–320, doi: 10.1145/2330163.2330209.'
mla: Bischl, Bernd, et al. “Algorithm Selection Based on Exploratory Landscape Analysis
and Cost-Sensitive Learning.” Proceedings of the 14th Annual Conference on
Genetic and Evolutionary Computation, Association for Computing Machinery,
2012, pp. 313–320, doi:10.1145/2330163.2330209.
short: 'B. Bischl, O. Mersmann, H. Trautmann, M. Preuß, in: Proceedings of the 14th
Annual Conference on Genetic and Evolutionary Computation, Association for Computing
Machinery, New York, NY, USA, 2012, pp. 313–320.'
date_created: 2023-08-04T15:51:56Z
date_updated: 2023-10-16T13:48:48Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2330163.2330209
keyword:
- machine learning
- exploratory landscape analysis
- fitness landscape
- benchmarking
- evolutionary optimization
- bbob test set
- algorithm selection
language:
- iso: eng
page: 313–320
place: New York, NY, USA
publication: Proceedings of the 14th Annual Conference on Genetic and Evolutionary
Computation
publication_identifier:
isbn:
- '9781450311779'
publisher: Association for Computing Machinery
series_title: GECCO ’12
status: public
title: Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive
Learning
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '46399'
abstract:
- lang: eng
text: Meta-modeling has become a crucial tool in solving expensive optimization
problems. Much of the work in the past has focused on finding a good regression
method to model the fitness function. Examples include classical linear regression,
splines, neural networks, Kriging and support vector regression. This paper specifically
draws attention to the fact that assessing model accuracy is a crucial aspect
in the meta-modeling framework. Resampling strategies such as cross-validation,
subsampling, bootstrapping, and nested resampling are prominent methods for model
validation and are systematically discussed with respect to possible pitfalls,
shortcomings, and specific features. A survey of meta-modeling techniques within
evolutionary optimization is provided. In addition, practical examples illustrating
some of the pitfalls associated with model selection and performance assessment
are presented. Finally, recommendations are given for choosing a model validation
technique for a particular setting.
author:
- first_name: B
full_name: Bischl, B
last_name: Bischl
- first_name: O
full_name: Mersmann, O
last_name: Mersmann
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: C
full_name: Weihs, C
last_name: Weihs
citation:
ama: Bischl B, Mersmann O, Trautmann H, Weihs C. Resampling Methods in Model Validation.
Evolutionary Computation Journal. 2012;20(2):249–275. doi:10.1162/EVCO_a_00069
apa: Bischl, B., Mersmann, O., Trautmann, H., & Weihs, C. (2012). Resampling
Methods in Model Validation. Evolutionary Computation Journal, 20(2),
249–275. https://doi.org/10.1162/EVCO_a_00069
bibtex: '@article{Bischl_Mersmann_Trautmann_Weihs_2012, title={Resampling Methods
in Model Validation}, volume={20}, DOI={10.1162/EVCO_a_00069},
number={2}, journal={Evolutionary Computation Journal}, author={Bischl, B and
Mersmann, O and Trautmann, Heike and Weihs, C}, year={2012}, pages={249–275} }'
chicago: 'Bischl, B, O Mersmann, Heike Trautmann, and C Weihs. “Resampling Methods
in Model Validation.” Evolutionary Computation Journal 20, no. 2 (2012):
249–275. https://doi.org/10.1162/EVCO_a_00069.'
ieee: 'B. Bischl, O. Mersmann, H. Trautmann, and C. Weihs, “Resampling Methods in
Model Validation,” Evolutionary Computation Journal, vol. 20, no. 2, pp.
249–275, 2012, doi: 10.1162/EVCO_a_00069.'
mla: Bischl, B., et al. “Resampling Methods in Model Validation.” Evolutionary
Computation Journal, vol. 20, no. 2, 2012, pp. 249–275, doi:10.1162/EVCO_a_00069.
short: B. Bischl, O. Mersmann, H. Trautmann, C. Weihs, Evolutionary Computation
Journal 20 (2012) 249–275.
date_created: 2023-08-04T15:54:41Z
date_updated: 2023-10-16T13:53:58Z
department:
- _id: '34'
- _id: '819'
doi: 10.1162/EVCO_a_00069
intvolume: ' 20'
issue: '2'
language:
- iso: eng
page: 249–275
publication: Evolutionary Computation Journal
status: public
title: Resampling Methods in Model Validation
type: journal_article
user_id: '15504'
volume: 20
year: '2012'
...
---
_id: '46400'
abstract:
- lang: ger
text: Es werden mehrkriterielle evolutio-näre Algorithmen (EMOA) für zwei- und höherdimensio-nale Probleme vorgestellt, die gleichmäßig verteilte Lö-sungen entlang der wahren Paretofront generieren. Diesist insbesondere wichtig im Kontext mehrkriterieller Kon-trollprobleme. Die Methodik beruht auf der Minimierungdes gemittelten Hausdorff-Abstandes
in Bezug aufdie Paretofront. Die EMOA-Varianten werden vergleichendzu aktuellen Verfahren auf Benchmarkproblemen getestet.
author:
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: O
full_name: Schütze, O
last_name: Schütze
citation:
ama: Rudolph G, Trautmann H, Schütze O. Homogene Approximation der Paretofront bei
mehrkriteriellen Kontrollproblemen. at-Automatisierungstechnik. 2012;60:610–621.
doi:10.1524/auto.2012.1033
apa: Rudolph, G., Trautmann, H., & Schütze, O. (2012). Homogene Approximation
der Paretofront bei mehrkriteriellen Kontrollproblemen. At-Automatisierungstechnik,
60, 610–621. https://doi.org/10.1524/auto.2012.1033
bibtex: '@article{Rudolph_Trautmann_Schütze_2012, title={Homogene Approximation
der Paretofront bei mehrkriteriellen Kontrollproblemen}, volume={60}, DOI={10.1524/auto.2012.1033}, journal={at-Automatisierungstechnik},
author={Rudolph, G and Trautmann, Heike and Schütze, O}, year={2012}, pages={610–621}
}'
chicago: 'Rudolph, G, Heike Trautmann, and O Schütze. “Homogene Approximation Der
Paretofront Bei Mehrkriteriellen Kontrollproblemen.” At-Automatisierungstechnik
60 (2012): 610–621. https://doi.org/10.1524/auto.2012.1033.'
ieee: 'G. Rudolph, H. Trautmann, and O. Schütze, “Homogene Approximation der Paretofront
bei mehrkriteriellen Kontrollproblemen,” at-Automatisierungstechnik, vol.
60, pp. 610–621, 2012, doi: 10.1524/auto.2012.1033.'
mla: Rudolph, G., et al. “Homogene Approximation Der Paretofront Bei Mehrkriteriellen
Kontrollproblemen.” At-Automatisierungstechnik, vol. 60, 2012, pp. 610–621,
doi:10.1524/auto.2012.1033.
short: G. Rudolph, H. Trautmann, O. Schütze, At-Automatisierungstechnik 60 (2012)
610–621.
date_created: 2023-08-04T15:55:34Z
date_updated: 2023-10-16T13:54:17Z
department:
- _id: '34'
- _id: '819'
doi: 10.1524/auto.2012.1033
intvolume: ' 60'
language:
- iso: eng
page: 610–621
publication: at-Automatisierungstechnik
status: public
title: Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen
type: journal_article
user_id: '15504'
volume: 60
year: '2012'
...
---
_id: '48890'
abstract:
- lang: eng
text: With this paper we contribute to the understanding of the success of 2-opt
based local search algorithms for solving the traveling salesman problem TSP.
Although 2-opt is widely used in practice, it is hard to understand its success
from a theoretical perspective. We take a statistical approach and examine the
features of TSP instances that make the problem either hard or easy to solve.
As a measure of problem difficulty for 2-opt we use the approximation ratio that
it achieves on a given instance. Our investigations point out important features
that make TSP instances hard or easy to be approximated by 2-opt.
author:
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- 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
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search
and the Traveling Salesman Problem: A Feature-Based Characterization of Problem
Hardness. In: Revised Selected Papers of the 6th International Conference on
Learning and Intelligent Optimization - Volume 7219. LION 6. Springer-Verlag;
2012:115–129.'
apa: 'Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., & Neumann,
F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness. Revised Selected Papers of the 6th International Conference
on Learning and Intelligent Optimization - Volume 7219, 115–129.'
bibtex: '@inproceedings{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin,
Heidelberg}, series={LION 6}, title={Local Search and the Traveling Salesman Problem:
A Feature-Based Characterization of Problem Hardness}, booktitle={Revised Selected
Papers of the 6th International Conference on Learning and Intelligent Optimization
- Volume 7219}, publisher={Springer-Verlag}, author={Mersmann, Olaf and Bischl,
Bernd and Bossek, Jakob and Trautmann, Heike and Wagner, Markus and Neumann, Frank},
year={2012}, pages={115–129}, collection={LION 6} }'
chicago: 'Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner,
and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based
Characterization of Problem Hardness.” In Revised Selected Papers of the 6th
International Conference on Learning and Intelligent Optimization - Volume 7219,
115–129. LION 6. Berlin, Heidelberg: Springer-Verlag, 2012.'
ieee: 'O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann,
“Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness,” in Revised Selected Papers of the 6th International Conference
on Learning and Intelligent Optimization - Volume 7219, 2012, pp. 115–129.'
mla: 'Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A
Feature-Based Characterization of Problem Hardness.” Revised Selected Papers
of the 6th International Conference on Learning and Intelligent Optimization -
Volume 7219, Springer-Verlag, 2012, pp. 115–129.'
short: 'O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann,
in: Revised Selected Papers of the 6th International Conference on Learning and
Intelligent Optimization - Volume 7219, Springer-Verlag, Berlin, Heidelberg, 2012,
pp. 115–129.'
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:48:58Z
department:
- _id: '819'
extern: '1'
keyword:
- 2-opt
- Classification
- Feature Selection
- MARS
- TSP
language:
- iso: eng
page: 115–129
place: Berlin, Heidelberg
publication: Revised Selected Papers of the 6th International Conference on Learning
and Intelligent Optimization - Volume 7219
publication_identifier:
isbn:
- 978-3-642-34412-1
publisher: Springer-Verlag
series_title: LION 6
status: public
title: 'Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness'
type: conference
user_id: '102979'
year: '2012'
...
---
_id: '48888'
abstract:
- lang: eng
text: With this paper we contribute to the understanding of the success of 2-opt
based local search algorithms for solving the traveling salesman problem (TSP).
Although 2-opt is widely used in practice, it is hard to understand its success
from a theoretical perspective. We take a statistical approach and examine the
features of TSP instances that make the problem either hard or easy to solve.
As a measure of problem difficulty for 2-opt we use the approximation ratio that
it achieves on a given instance. Our investigations point out important features
that make TSP instances hard or easy to be approximated by 2-opt.
author:
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- 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
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search
and the Traveling Salesman Problem: A Feature-Based Characterization of Problem
Hardness. In: Learning and Intelligent Optimization. Vol 7219. Springer
Berlin Heidelberg; 2012:115–129. doi:10.1007/978-3-642-34413-8_9'
apa: 'Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., & Neumann,
F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness. In Learning and Intelligent Optimization (Vol. 7219,
pp. 115–129). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-34413-8_9'
bibtex: '@inbook{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin,
Heidelberg}, title={Local Search and the Traveling Salesman Problem: A Feature-Based
Characterization of Problem Hardness}, volume={7219}, DOI={10.1007/978-3-642-34413-8_9},
booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin
Heidelberg}, author={Mersmann, Olaf and Bischl, Bernd and Bossek, Jakob and Trautmann,
Heike and Wagner, Markus and Neumann, Frank}, year={2012}, pages={115–129} }'
chicago: 'Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner,
and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based
Characterization of Problem Hardness.” In Learning and Intelligent Optimization,
7219:115–129. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-34413-8_9.'
ieee: 'O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann,
“Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness,” in Learning and Intelligent Optimization, vol. 7219,
Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 115–129.'
mla: 'Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A
Feature-Based Characterization of Problem Hardness.” Learning and Intelligent
Optimization, vol. 7219, Springer Berlin Heidelberg, 2012, pp. 115–129, doi:10.1007/978-3-642-34413-8_9.'
short: 'O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann,
in: Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin,
Heidelberg, 2012, pp. 115–129.'
date_created: 2023-11-14T15:58:59Z
date_updated: 2023-12-13T10:49:15Z
department:
- _id: '819'
doi: 10.1007/978-3-642-34413-8_9
extern: '1'
intvolume: ' 7219'
language:
- iso: eng
page: 115–129
place: Berlin, Heidelberg
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-642-34412-1 978-3-642-34413-8
publisher: Springer Berlin Heidelberg
status: public
title: 'Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness'
type: book_chapter
user_id: '102979'
volume: 7219
year: '2012'
...
---
_id: '26038'
abstract:
- lang: eng
text: We present an enhanced UVM for SystemC library which incorporates verification
best practices from OVM-ML and UVM as well as project partner implementations.
Moreover, we extended functionality and implemented missing features, such as
domain specific components, stimuli sequence generation and management, call-back
facilities, response to request routing, transaction recording and many more.
Apart from that, we added crucial verification components, such as functional
coverage.
author:
- first_name: Christoph
full_name: Kuznik, Christoph
last_name: Kuznik
- first_name: Marcio F.
full_name: Oliveira, Marcio F.
last_name: Oliveira
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: Kuznik C, Oliveira MF, Müller W. SYSTEMC UVM VERIFICATION COMPONENTS. Design,
Automation and Test in Europe DATE. Published online 2012.
apa: Kuznik, C., Oliveira, M. F., & Müller, W. (2012). SYSTEMC UVM VERIFICATION
COMPONENTS. Design, Automation and Test in Europe DATE.
bibtex: '@article{Kuznik_Oliveira_Müller_2012, title={SYSTEMC UVM VERIFICATION COMPONENTS},
journal={Design, Automation and Test in Europe DATE}, author={Kuznik, Christoph
and Oliveira, Marcio F. and Müller, Wolfgang}, year={2012} }'
chicago: Kuznik, Christoph, Marcio F. Oliveira, and Wolfgang Müller. “SYSTEMC UVM
VERIFICATION COMPONENTS.” Design, Automation and Test in Europe DATE, 2012.
ieee: C. Kuznik, M. F. Oliveira, and W. Müller, “SYSTEMC UVM VERIFICATION COMPONENTS,”
Design, Automation and Test in Europe DATE, 2012.
mla: Kuznik, Christoph, et al. “SYSTEMC UVM VERIFICATION COMPONENTS.” Design,
Automation and Test in Europe DATE, 2012.
short: C. Kuznik, M.F. Oliveira, W. Müller, Design, Automation and Test in Europe
DATE (2012).
conference:
location: ' University Booth, Dresden , Mrz. 2012'
date_created: 2021-10-11T12:48:21Z
date_updated: 2024-04-18T21:07:25Z
department:
- _id: '672'
language:
- iso: eng
publication: Design, Automation and Test in Europe DATE
status: public
title: SYSTEMC UVM VERIFICATION COMPONENTS
type: journal_article
user_id: '5786'
year: '2012'
...
---
_id: '46398'
abstract:
- lang: eng
text: With this paper we contribute to the understanding of the success of 2-opt
based local search algorithms for solving the traveling salesman problem (TSP).
Although 2-opt is widely used in practice, it is hard to understand its success
from a theoretical perspective. We take a statistical approach and examine the
features of TSP instances that make the problem either hard or easy to solve.
As a measure of problem difficulty for 2-opt we use the approximation ratio that
it achieves on a given instance. Our investigations point out important features
that make TSP instances hard or easy to be approximated by 2-opt.
author:
- first_name: Olaf
full_name: Mersmann, Olaf
last_name: Mersmann
- first_name: Bernd
full_name: Bischl, Bernd
last_name: Bischl
- 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
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search
and the Traveling Salesman Problem: A Feature-Based Characterization of Problem
Hardness. In: Hamadi Y, Schoenauer M, eds. Learning and Intelligent Optimization.
Springer Berlin Heidelberg; 2012:115–129. doi:https://doi.org/10.1007/978-3-642-34413-8_9'
apa: 'Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., & Neumann,
F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness. In Y. Hamadi & M. Schoenauer (Eds.), Learning and
Intelligent Optimization (pp. 115–129). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-34413-8_9'
bibtex: '@inproceedings{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin,
Heidelberg}, title={Local Search and the Traveling Salesman Problem: A Feature-Based
Characterization of Problem Hardness}, DOI={https://doi.org/10.1007/978-3-642-34413-8_9},
booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin
Heidelberg}, author={Mersmann, Olaf and Bischl, Bernd and Bossek, Jakob and Trautmann,
Heike and Wagner, Markus and Neumann, Frank}, editor={Hamadi, Youssef and Schoenauer,
Marc}, year={2012}, pages={115–129} }'
chicago: 'Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner,
and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based
Characterization of Problem Hardness.” In Learning and Intelligent Optimization,
edited by Youssef Hamadi and Marc Schoenauer, 115–129. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-34413-8_9.'
ieee: 'O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann,
“Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness,” in Learning and Intelligent Optimization, 2012, pp.
115–129, doi: https://doi.org/10.1007/978-3-642-34413-8_9.'
mla: 'Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A
Feature-Based Characterization of Problem Hardness.” Learning and Intelligent
Optimization, edited by Youssef Hamadi and Marc Schoenauer, Springer Berlin
Heidelberg, 2012, pp. 115–129, doi:https://doi.org/10.1007/978-3-642-34413-8_9.'
short: 'O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann,
in: Y. Hamadi, M. Schoenauer (Eds.), Learning and Intelligent Optimization, Springer
Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 115–129.'
date_created: 2023-08-04T15:53:33Z
date_updated: 2024-06-10T11:57:32Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1007/978-3-642-34413-8_9
editor:
- first_name: Youssef
full_name: Hamadi, Youssef
last_name: Hamadi
- first_name: Marc
full_name: Schoenauer, Marc
last_name: Schoenauer
language:
- iso: eng
page: 115–129
place: Berlin, Heidelberg
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-642-34413-8
publisher: Springer Berlin Heidelberg
status: public
title: 'Local Search and the Traveling Salesman Problem: A Feature-Based Characterization
of Problem Hardness'
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '36922'
abstract:
- lang: eng
text: In this paper we present an approach for the self reconfiguration of distributed
micro-controllers for increased fault tolerance. Based on a modified distributed
system topology utilizing a time division multiple access (TDMA) protocol, i.e.,
Flex Ray, we present a self-organized distributed coordinator concept which performs
the self-reconfiguration in the case of node failures. We introduce a distributed
coordinator, which utilizes redundant slots in the Flex Ray communication schedule
and combines messages in configured protocol frames and slots to avoid a complete
bus restart. As such, the self-reconfiguration is realized by means of predetermined
information about resulting changes in the communication dependencies and (re-)assignments
determined in the design phase. To retrieve the necessary information, we present
an analytical approach, which determines a combined solution for the initial configuration
and all possible reconfigurations for the remaining nodes of the Flex Ray network
in case of node failures. Hence, through this method we can design self-reconfiguring
network-based systems enabling the handling of node failures for an increased
fault tolerance.
author:
- first_name: Kay
full_name: Klobedanz, Kay
last_name: Klobedanz
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Achim
full_name: Rettberg, Achim
last_name: Rettberg
citation:
ama: 'Klobedanz K, Müller W, Rettberg A. An Approach for Self-Reconfiguring and
Fault-Tolerant Distributed Real-Time Systems. In: IEEE; 2012. doi:10.1109/ISORCW.2012.41'
apa: Klobedanz, K., Müller, W., & Rettberg, A. (2012). An Approach for Self-Reconfiguring
and Fault-Tolerant Distributed Real-Time Systems. IEEE 15th International
Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing
Workshops. https://doi.org/10.1109/ISORCW.2012.41
bibtex: '@inproceedings{Klobedanz_Müller_Rettberg_2012, place={Shenzhen, China },
title={An Approach for Self-Reconfiguring and Fault-Tolerant Distributed Real-Time
Systems}, DOI={10.1109/ISORCW.2012.41},
publisher={IEEE}, author={Klobedanz, Kay and Müller, Wolfgang and Rettberg, Achim},
year={2012} }'
chicago: 'Klobedanz, Kay, Wolfgang Müller, and Achim Rettberg. “An Approach for
Self-Reconfiguring and Fault-Tolerant Distributed Real-Time Systems.” Shenzhen,
China : IEEE, 2012. https://doi.org/10.1109/ISORCW.2012.41.'
ieee: 'K. Klobedanz, W. Müller, and A. Rettberg, “An Approach for Self-Reconfiguring
and Fault-Tolerant Distributed Real-Time Systems,” presented at the IEEE 15th
International Symposium on Object/Component/Service-Oriented Real-Time Distributed
Computing Workshops, 2012, doi: 10.1109/ISORCW.2012.41.'
mla: Klobedanz, Kay, et al. An Approach for Self-Reconfiguring and Fault-Tolerant
Distributed Real-Time Systems. IEEE, 2012, doi:10.1109/ISORCW.2012.41.
short: 'K. Klobedanz, W. Müller, A. Rettberg, in: IEEE, Shenzhen, China , 2012.'
conference:
name: IEEE 15th International Symposium on Object/Component/Service-Oriented Real-Time
Distributed Computing Workshops
date_created: 2023-01-16T12:23:50Z
date_updated: 2023-01-16T12:25:33Z
department:
- _id: '672'
doi: 10.1109/ISORCW.2012.41
keyword:
- Real time systems
- Fault tolerant systems
- Schedules
- Protocols
- Redundancy
- Delay
language:
- iso: eng
place: 'Shenzhen, China '
publication_identifier:
eisbn:
- 978-0-7695-4669-8
publisher: IEEE
status: public
title: An Approach for Self-Reconfiguring and Fault-Tolerant Distributed Real-Time
Systems
type: conference
user_id: '5786'
year: '2012'
...
---
_id: '36921'
author:
- first_name: M. F.
full_name: Oliveira, M. F.
last_name: Oliveira
- first_name: Christoph
full_name: Kuznik, Christoph
last_name: Kuznik
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: V.
full_name: Esen, V.
last_name: Esen
- first_name: W.
full_name: Ecker, W.
last_name: Ecker
citation:
ama: 'Oliveira MF, Kuznik C, Müller W, Esen V, Ecker W. Towards an Enhanced UVM
for SystemC. In: Proceedings of the Design & Verification Conference (DVCon).
; 2012.'
apa: Oliveira, M. F., Kuznik, C., Müller, W., Esen, V., & Ecker, W. (2012).
Towards an Enhanced UVM for SystemC. Proceedings of the Design & Verification
Conference (DVCon).
bibtex: '@inproceedings{Oliveira_Kuznik_Müller_Esen_Ecker_2012, place={San Jose},
title={Towards an Enhanced UVM for SystemC}, booktitle={Proceedings of the Design
& Verification Conference (DVCon)}, author={Oliveira, M. F. and Kuznik, Christoph
and Müller, Wolfgang and Esen, V. and Ecker, W.}, year={2012} }'
chicago: Oliveira, M. F., Christoph Kuznik, Wolfgang Müller, V. Esen, and W. Ecker.
“Towards an Enhanced UVM for SystemC.” In Proceedings of the Design & Verification
Conference (DVCon). San Jose, 2012.
ieee: M. F. Oliveira, C. Kuznik, W. Müller, V. Esen, and W. Ecker, “Towards an Enhanced
UVM for SystemC,” 2012.
mla: Oliveira, M. F., et al. “Towards an Enhanced UVM for SystemC.” Proceedings
of the Design & Verification Conference (DVCon), 2012.
short: 'M.F. Oliveira, C. Kuznik, W. Müller, V. Esen, W. Ecker, in: Proceedings
of the Design & Verification Conference (DVCon), San Jose, 2012.'
date_created: 2023-01-16T12:19:39Z
date_updated: 2023-01-16T12:21:17Z
department:
- _id: '672'
language:
- iso: eng
place: San Jose
publication: Proceedings of the Design & Verification Conference (DVCon)
status: public
title: Towards an Enhanced UVM for SystemC
type: conference
user_id: '5786'
year: '2012'
...
---
_id: '36994'
abstract:
- lang: eng
text: This paper proposes a quality driven, simulation based approach to functional
design verification, which applies mainly to IP-level HDL designs with well specified
test instruction format and is evaluated on a soft microprocessor core MB-LITE
[5]. The approach utilizes mutation analysis as the quality metric to steer an
automated simulation data generation process. It leads to a simulation flow with
two phases towards an enhanced mutation analysis result. First in a random simulation
phase, an in-loop heuristics is deployed and adjusts dynamically the test probability
distribution so as to improve the coverage efficiency. Next, for each remaining
hard-to-kill mutant, a search heuristics on test input space is developed to iteratively
locate a target test, using a specific objective cost function for the goal of
killing HDL mutant. The effectiveness of this integrated two-phase simulation
flow is demonstrated by the results with the MB-LITE microprocessor IP.
author:
- first_name: 'Tao '
full_name: 'Xie, Tao '
last_name: Xie
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
- first_name: Florian
full_name: Letombe, Florian
last_name: Letombe
citation:
ama: 'Xie T, Müller W, Letombe F. Mutation-Analysis Driven Functional Verification
of a Soft Microprocessor. In: Proceedings of SOCC2012. IEEE; 2012. doi:10.1109/SOCC.2012.6398362'
apa: Xie, T., Müller, W., & Letombe, F. (2012). Mutation-Analysis Driven Functional
Verification of a Soft Microprocessor. Proceedings of SOCC2012. https://doi.org/10.1109/SOCC.2012.6398362
bibtex: '@inproceedings{Xie_Müller_Letombe_2012, place={ Niagara Falls, NY, USA
}, title={Mutation-Analysis Driven Functional Verification of a Soft Microprocessor},
DOI={10.1109/SOCC.2012.6398362},
booktitle={Proceedings of SOCC2012}, publisher={IEEE}, author={Xie, Tao and Müller,
Wolfgang and Letombe, Florian}, year={2012} }'
chicago: 'Xie, Tao , Wolfgang Müller, and Florian Letombe. “Mutation-Analysis Driven
Functional Verification of a Soft Microprocessor.” In Proceedings of SOCC2012. Niagara
Falls, NY, USA : IEEE, 2012. https://doi.org/10.1109/SOCC.2012.6398362.'
ieee: 'T. Xie, W. Müller, and F. Letombe, “Mutation-Analysis Driven Functional Verification
of a Soft Microprocessor,” 2012, doi: 10.1109/SOCC.2012.6398362.'
mla: Xie, Tao, et al. “Mutation-Analysis Driven Functional Verification of a Soft
Microprocessor.” Proceedings of SOCC2012, IEEE, 2012, doi:10.1109/SOCC.2012.6398362.
short: 'T. Xie, W. Müller, F. Letombe, in: Proceedings of SOCC2012, IEEE, Niagara
Falls, NY, USA , 2012.'
date_created: 2023-01-17T08:46:14Z
date_updated: 2023-01-17T08:46:29Z
department:
- _id: '672'
doi: 10.1109/SOCC.2012.6398362
keyword:
- Analytical models
- Hardware design languages
- Microprocessors
- Cost function
- Data models
- Search problems
- IP networks
language:
- iso: eng
place: ' Niagara Falls, NY, USA '
publication: Proceedings of SOCC2012
publication_identifier:
eisbn:
- 978-1-4673-1295-0
publisher: IEEE
status: public
title: Mutation-Analysis Driven Functional Verification of a Soft Microprocessor
type: conference
user_id: '5786'
year: '2012'
...
---
_id: '36997'
author:
- first_name: Tao
full_name: Xie, Tao
last_name: Xie
- first_name: Wolfgang
full_name: Müller, Wolfgang
id: '16243'
last_name: Müller
citation:
ama: 'Xie T, Müller W. An IP-XACT-TO-SystemC Model Generator for Mutation Analysis.
In: Proceedings of the MeCoES’12. ; 2012.'
apa: Xie, T., & Müller, W. (2012). An IP-XACT-TO-SystemC Model Generator for
Mutation Analysis. Proceedings of the MeCoES’12.
bibtex: '@inproceedings{Xie_Müller_2012, place={Tampere, Finnland}, title={An IP-XACT-TO-SystemC
Model Generator for Mutation Analysis}, booktitle={Proceedings of the MeCoES’12},
author={Xie, Tao and Müller, Wolfgang}, year={2012} }'
chicago: Xie, Tao, and Wolfgang Müller. “An IP-XACT-TO-SystemC Model Generator for
Mutation Analysis.” In Proceedings of the MeCoES’12. Tampere, Finnland,
2012.
ieee: T. Xie and W. Müller, “An IP-XACT-TO-SystemC Model Generator for Mutation
Analysis,” 2012.
mla: Xie, Tao, and Wolfgang Müller. “An IP-XACT-TO-SystemC Model Generator for Mutation
Analysis.” Proceedings of the MeCoES’12, 2012.
short: 'T. Xie, W. Müller, in: Proceedings of the MeCoES’12, Tampere, Finnland,
2012.'
date_created: 2023-01-17T08:52:59Z
date_updated: 2023-01-17T08:53:54Z
department:
- _id: '672'
language:
- iso: eng
place: Tampere, Finnland
publication: Proceedings of the MeCoES’12
status: public
title: An IP-XACT-TO-SystemC Model Generator for Mutation Analysis
type: conference
user_id: '5786'
year: '2012'
...
---
_id: '8169'
abstract:
- lang: eng
text: The polynomial hierarchy plays a central role in classical complexity theory.
Here, we define a quantum generalization of the polynomial hierarchy, and initiate
its study. We show that not only are there natural complete problems for the second
level of this quantum hierarchy, but that these problems are in fact hard to approximate.
Our work thus yields the first known hardness of approximation results for a quantum
complexity class. Using these techniques, we also obtain hardness of approximation
for the class QCMA. Our approach is based on the use of dispersers, and is inspired
by the classical results of Umans regarding hardness of approximation for the
second level of the classical polynomial hierarchy (Umans 1999). We close by showing
that a variant of the local Hamiltonian problem with hybrid classical-quantum
ground states is complete for the second level of our quantum hierarchy.
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Julia
full_name: Kempe, Julia
last_name: Kempe
citation:
ama: 'Gharibian S, Kempe J. Hardness of Approximation for Quantum Problems. In:
Czumaj A, Mehlhorn K, Pitts A, Wattenhofer R, eds. International Colloquium
on Automata, Languages, and Programming (ICALP 2012). Springer Berlin Heidelberg;
2012:387-398. doi:10.1007/978-3-642-31594-7_33'
apa: Gharibian, S., & Kempe, J. (2012). Hardness of Approximation for Quantum
Problems. In A. Czumaj, K. Mehlhorn, A. Pitts, & R. Wattenhofer (Eds.), International
Colloquium on Automata, Languages, and Programming (ICALP 2012) (pp. 387–398).
Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-31594-7_33
bibtex: '@inproceedings{Gharibian_Kempe_2012, place={Berlin, Heidelberg}, title={Hardness
of Approximation for Quantum Problems}, DOI={10.1007/978-3-642-31594-7_33},
booktitle={International Colloquium on Automata, Languages, and Programming (ICALP
2012)}, publisher={Springer Berlin Heidelberg}, author={Gharibian, Sevag and Kempe,
Julia}, editor={Czumaj, Artur and Mehlhorn, Kurt and Pitts, Andrew and Wattenhofer,
Roger}, year={2012}, pages={387–398} }'
chicago: 'Gharibian, Sevag, and Julia Kempe. “Hardness of Approximation for Quantum
Problems.” In International Colloquium on Automata, Languages, and Programming
(ICALP 2012), edited by Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, and Roger
Wattenhofer, 387–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. https://doi.org/10.1007/978-3-642-31594-7_33.'
ieee: 'S. Gharibian and J. Kempe, “Hardness of Approximation for Quantum Problems,”
in International Colloquium on Automata, Languages, and Programming (ICALP
2012), Warwick, UK, 2012, pp. 387–398, doi: 10.1007/978-3-642-31594-7_33.'
mla: Gharibian, Sevag, and Julia Kempe. “Hardness of Approximation for Quantum Problems.”
International Colloquium on Automata, Languages, and Programming (ICALP 2012),
edited by Artur Czumaj et al., Springer Berlin Heidelberg, 2012, pp. 387–98, doi:10.1007/978-3-642-31594-7_33.
short: 'S. Gharibian, J. Kempe, in: A. Czumaj, K. Mehlhorn, A. Pitts, R. Wattenhofer
(Eds.), International Colloquium on Automata, Languages, and Programming (ICALP
2012), Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 387–398.'
conference:
location: Warwick, UK
name: International Colloquium on Automata, Languages, and Programming (ICALP)
date_created: 2019-03-01T11:55:18Z
date_updated: 2023-02-28T11:03:26Z
department:
- _id: '623'
- _id: '7'
doi: 10.1007/978-3-642-31594-7_33
editor:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Kurt
full_name: Mehlhorn, Kurt
last_name: Mehlhorn
- first_name: Andrew
full_name: Pitts, Andrew
last_name: Pitts
- first_name: Roger
full_name: Wattenhofer, Roger
last_name: Wattenhofer
extern: '1'
external_id:
arxiv:
- '1209.1055'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1209.1055
oa: '1'
page: 387-398
place: Berlin, Heidelberg
publication: International Colloquium on Automata, Languages, and Programming (ICALP
2012)
publication_identifier:
isbn:
- 978-3-642-31594-7
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Hardness of Approximation for Quantum Problems
type: conference
user_id: '71541'
year: '2012'
...
---
_id: '8175'
abstract:
- lang: eng
text: Approximation algorithms for classical constraint satisfaction problems are
one of the main research areas in theoretical computer science. Here we define
a natural approximation version of the QMA-complete local Hamiltonian problem
(where QMA stands for Quantum Merlin Arthur) and initiate its study. We present
two main results. The first shows that a nontrivial approximation ratio can be
obtained in the class NP using product states. The second result (which builds
on the first one) gives a polynomial time (classical) algorithm providing a similar
approximation ratio for dense instances of the problem. The latter result is based
on an adaptation of the “exhaustive sampling method” by Arora, Karger, and Karpinski
[J. Comput. System Sci., 58 (1999), p. 193] to the quantum setting and might be
of independent interest.
article_type: original
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
- first_name: Julia
full_name: Kempe, Julia
last_name: Kempe
citation:
ama: Gharibian S, Kempe J. Approximation Algorithms for QMA-Complete Problems. SIAM
Journal on Computing. 2012;41(4):1028-1050. doi:10.1137/110842272
apa: Gharibian, S., & Kempe, J. (2012). Approximation Algorithms for QMA-Complete
Problems. SIAM Journal on Computing, 41(4), 1028–1050. https://doi.org/10.1137/110842272
bibtex: '@article{Gharibian_Kempe_2012, title={Approximation Algorithms for QMA-Complete
Problems}, volume={41}, DOI={10.1137/110842272},
number={4}, journal={SIAM Journal on Computing}, publisher={Society for Industrial
& Applied Mathematics (SIAM)}, author={Gharibian, Sevag and Kempe, Julia},
year={2012}, pages={1028–1050} }'
chicago: 'Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete
Problems.” SIAM Journal on Computing 41, no. 4 (2012): 1028–50. https://doi.org/10.1137/110842272.'
ieee: 'S. Gharibian and J. Kempe, “Approximation Algorithms for QMA-Complete Problems,”
SIAM Journal on Computing, vol. 41, no. 4, pp. 1028–1050, 2012, doi: 10.1137/110842272.'
mla: Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete
Problems.” SIAM Journal on Computing, vol. 41, no. 4, Society for Industrial
& Applied Mathematics (SIAM), 2012, pp. 1028–50, doi:10.1137/110842272.
short: S. Gharibian, J. Kempe, SIAM Journal on Computing 41 (2012) 1028–1050.
date_created: 2019-03-01T12:04:03Z
date_updated: 2023-02-28T11:03:50Z
department:
- _id: '623'
- _id: '7'
doi: 10.1137/110842272
extern: '1'
external_id:
arxiv:
- '1101.3884'
intvolume: ' 41'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1101.3884
oa: '1'
page: 1028-1050
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
publisher: Society for Industrial & Applied Mathematics (SIAM)
status: public
title: Approximation Algorithms for QMA-Complete Problems
type: journal_article
user_id: '71541'
volume: 41
year: '2012'
...
---
_id: '8174'
abstract:
- lang: eng
text: We propose a measure of non-classical correlations in bipartite quantum states
based on local unitary operations. We prove the measure is non-zero if and only
if the quantum discord is non-zero; this is achieved via a new characterization
of zero discord states in terms of the state's correlation matrix. Moreover, our
scheme can be extended to ensure the same relationship holds even with a generalized
version of quantum discord in which higher-rank projective measurements are allowed.
We next derive a closed form expression for our scheme in the cases of Werner
states and (2 x N)-dimensional systems. The latter reveals that for (2 x N)-dimensional
states, our measure reduces to the geometric discord [Dakic et al., PRL 105, 2010].
A connection to the CHSH inequality is shown. We close with a characterization
of all maximally non-classical, yet separable, (2 x N)-dimensional states of rank
at most two (with respect to our measure).
article_type: original
author:
- first_name: Sevag
full_name: Gharibian, Sevag
id: '71541'
last_name: Gharibian
orcid: 0000-0002-9992-3379
citation:
ama: Gharibian S. Quantifying nonclassicality with local unitary operations. Physical
Review A. 2012;86:042106. doi:10.1103/PhysRevA.86.042106
apa: Gharibian, S. (2012). Quantifying nonclassicality with local unitary operations.
Physical Review A, 86, 042106. https://doi.org/10.1103/PhysRevA.86.042106
bibtex: '@article{Gharibian_2012, title={Quantifying nonclassicality with local
unitary operations}, volume={86}, DOI={10.1103/PhysRevA.86.042106},
journal={Physical Review A}, publisher={American Physical Society}, author={Gharibian,
Sevag}, year={2012}, pages={042106} }'
chicago: 'Gharibian, Sevag. “Quantifying Nonclassicality with Local Unitary Operations.”
Physical Review A 86 (2012): 042106. https://doi.org/10.1103/PhysRevA.86.042106.'
ieee: 'S. Gharibian, “Quantifying nonclassicality with local unitary operations,”
Physical Review A, vol. 86, p. 042106, 2012, doi: 10.1103/PhysRevA.86.042106.'
mla: Gharibian, Sevag. “Quantifying Nonclassicality with Local Unitary Operations.”
Physical Review A, vol. 86, American Physical Society, 2012, p. 042106,
doi:10.1103/PhysRevA.86.042106.
short: S. Gharibian, Physical Review A 86 (2012) 042106.
date_created: 2019-03-01T12:01:41Z
date_updated: 2023-02-28T11:03:38Z
department:
- _id: '623'
- _id: '7'
doi: 10.1103/PhysRevA.86.042106
extern: '1'
external_id:
arxiv:
- '1202.1598'
intvolume: ' 86'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1202.1598
oa: '1'
page: '042106'
publication: Physical Review A
publication_status: published
publisher: American Physical Society
status: public
title: Quantifying nonclassicality with local unitary operations
type: journal_article
user_id: '71541'
volume: 86
year: '2012'
...
---
_id: '2106'
abstract:
- lang: eng
text: "Although the benefits of FPGAs for accelerating scientific codes are widely
acknowledged, the use of FPGA accelerators in scientific computing is not widespread
because reaping these benefits requires knowledge of hardware design methods and
tools that is typically not available with domain scientists. A promising but
hardly investigated approach is to develop tool flows that keep the common languages
for scientific code (C,C++, and Fortran) and allow the developer to augment the
source code with OpenMPlike directives for instructing the compiler which parts
of the application shall be offloaded the FPGA accelerator.\r\nIn this work we
study whether the promise of effective FPGA acceleration with an OpenMP-like programming
effort\r\ncan actually be held. Our target system is the Convey HC-1 reconfigurable
computer for which an OpenMP-like\r\nprogramming environment exists. As case study
we use an application from computational nanophotonics. Our results\r\nshow that
a developer without previous FPGA experience could create an FPGA-accelerated
application that is competitive to an optimized OpenMP-parallelized CPU version
running on a two socket quad-core server. Finally, we discuss our experiences
with this tool flow and the Convey HC-1 from a productivity and economic point
of view."
author:
- first_name: Björn
full_name: Meyer, Björn
last_name: Meyer
- first_name: Jörn
full_name: Schumacher, Jörn
last_name: Schumacher
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Jens
full_name: Förstner, Jens
id: '158'
last_name: Förstner
orcid: 0000-0001-7059-9862
citation:
ama: 'Meyer B, Schumacher J, Plessl C, Förstner J. Convey Vector Personalities –
FPGA Acceleration with an OpenMP-like Effort? In: Proc. Int. Conf. on Field
Programmable Logic and Applications (FPL). IEEE; 2012:189-196. doi:10.1109/FPL.2012.6339370'
apa: Meyer, B., Schumacher, J., Plessl, C., & Förstner, J. (2012). Convey Vector
Personalities – FPGA Acceleration with an OpenMP-like Effort? Proc. Int. Conf.
on Field Programmable Logic and Applications (FPL), 189–196. https://doi.org/10.1109/FPL.2012.6339370
bibtex: '@inproceedings{Meyer_Schumacher_Plessl_Förstner_2012, title={Convey Vector
Personalities – FPGA Acceleration with an OpenMP-like Effort?}, DOI={10.1109/FPL.2012.6339370},
booktitle={Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)},
publisher={IEEE}, author={Meyer, Björn and Schumacher, Jörn and Plessl, Christian
and Förstner, Jens}, year={2012}, pages={189–196} }'
chicago: Meyer, Björn, Jörn Schumacher, Christian Plessl, and Jens Förstner. “Convey
Vector Personalities – FPGA Acceleration with an OpenMP-like Effort?” In Proc.
Int. Conf. on Field Programmable Logic and Applications (FPL), 189–96. IEEE,
2012. https://doi.org/10.1109/FPL.2012.6339370.
ieee: 'B. Meyer, J. Schumacher, C. Plessl, and J. Förstner, “Convey Vector Personalities
– FPGA Acceleration with an OpenMP-like Effort?,” in Proc. Int. Conf. on Field
Programmable Logic and Applications (FPL), 2012, pp. 189–196, doi: 10.1109/FPL.2012.6339370.'
mla: Meyer, Björn, et al. “Convey Vector Personalities – FPGA Acceleration with
an OpenMP-like Effort?” Proc. Int. Conf. on Field Programmable Logic and Applications
(FPL), IEEE, 2012, pp. 189–96, doi:10.1109/FPL.2012.6339370.
short: 'B. Meyer, J. Schumacher, C. Plessl, J. Förstner, in: Proc. Int. Conf. on
Field Programmable Logic and Applications (FPL), IEEE, 2012, pp. 189–196.'
conference:
name: 22nd International Conference on Field Programmable Logic and Applicaitons
(FPL)
date_created: 2018-03-29T15:04:25Z
date_updated: 2023-09-26T13:39:13Z
ddc:
- '000'
department:
- _id: '27'
- _id: '518'
- _id: '15'
- _id: '78'
doi: 10.1109/FPL.2012.6339370
file:
- access_level: closed
content_type: application/pdf
creator: fossie
date_created: 2019-02-13T09:04:46Z
date_updated: 2019-02-13T09:04:46Z
file_id: '7638'
file_name: 2012-11 Meyer,Schumacher,Plessl,Förstner_Convey vector personalities-FPGA
acceleratin with an openmp-like programming effort.pdf
file_size: 2148787
relation: main_file
success: 1
file_date_updated: 2019-02-13T09:04:46Z
has_accepted_license: '1'
keyword:
- funding-upb-forschungspreis
- funding-maxup
- tet_topic_hpc
language:
- iso: eng
page: 189-196
publication: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)
publisher: IEEE
quality_controlled: '1'
status: public
title: Convey Vector Personalities – FPGA Acceleration with an OpenMP-like Effort?
type: conference
user_id: '15278'
year: '2012'
...
---
_id: '2108'
author:
- first_name: Tobias
full_name: Schumacher, Tobias
last_name: Schumacher
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Schumacher T, Plessl C, Platzner M. IMORC: An Infrastructure and Architecture
Template for Implementing High-Performance Reconfigurable FPGA Accelerators. Microprocessors
and Microsystems. 2012;36(2):110-126. doi:10.1016/j.micpro.2011.04.002'
apa: 'Schumacher, T., Plessl, C., & Platzner, M. (2012). IMORC: An Infrastructure
and Architecture Template for Implementing High-Performance Reconfigurable FPGA
Accelerators. Microprocessors and Microsystems, 36(2), 110–126.
https://doi.org/10.1016/j.micpro.2011.04.002'
bibtex: '@article{Schumacher_Plessl_Platzner_2012, title={IMORC: An Infrastructure
and Architecture Template for Implementing High-Performance Reconfigurable FPGA
Accelerators}, volume={36}, DOI={10.1016/j.micpro.2011.04.002},
number={2}, journal={Microprocessors and Microsystems}, author={Schumacher, Tobias
and Plessl, Christian and Platzner, Marco}, year={2012}, pages={110–126} }'
chicago: 'Schumacher, Tobias, Christian Plessl, and Marco Platzner. “IMORC: An Infrastructure
and Architecture Template for Implementing High-Performance Reconfigurable FPGA
Accelerators.” Microprocessors and Microsystems 36, no. 2 (2012): 110–26.
https://doi.org/10.1016/j.micpro.2011.04.002.'
ieee: 'T. Schumacher, C. Plessl, and M. Platzner, “IMORC: An Infrastructure and
Architecture Template for Implementing High-Performance Reconfigurable FPGA Accelerators,”
Microprocessors and Microsystems, vol. 36, no. 2, pp. 110–126, 2012, doi:
10.1016/j.micpro.2011.04.002.'
mla: 'Schumacher, Tobias, et al. “IMORC: An Infrastructure and Architecture Template
for Implementing High-Performance Reconfigurable FPGA Accelerators.” Microprocessors
and Microsystems, vol. 36, no. 2, 2012, pp. 110–26, doi:10.1016/j.micpro.2011.04.002.'
short: T. Schumacher, C. Plessl, M. Platzner, Microprocessors and Microsystems 36
(2012) 110–126.
date_created: 2018-03-29T15:12:38Z
date_updated: 2023-09-26T13:39:30Z
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1016/j.micpro.2011.04.002
intvolume: ' 36'
issue: '2'
keyword:
- funding-altera
language:
- iso: eng
page: 110-126
publication: Microprocessors and Microsystems
publication_identifier:
issn:
- 0141-9331
quality_controlled: '1'
status: public
title: 'IMORC: An Infrastructure and Architecture Template for Implementing High-Performance
Reconfigurable FPGA Accelerators'
type: journal_article
user_id: '15278'
volume: 36
year: '2012'
...
---
_id: '615'
abstract:
- lang: eng
text: Due to the continuously shrinking device structures and increasing densities
of FPGAs, thermal aspects have become the new focus for many research projects
over the last years. Most researchers rely on temperature simulations to evaluate
their novel thermal management techniques. However, the accuracy of the simulations
is to some extent questionable and they require a high computational effort if
a detailed thermal model is used.For experimental evaluation of real-world temperature
management methods, often synthetic heat sources are employed. Therefore, in this
paper we investigated the question if we can create significant rises in temperature
on modern FPGAs to enable future evaluation of thermal management techniques based
on experiments in contrast to simulations. Therefore, we have developed eight
different heat-generating cores that use different subsets of the FPGA resources.
Our experimental results show that, according to the built-in thermal diode of
our Xilinx Virtex-5 FPGA, we can increase the chip temperature by 134 degree C
in less than 12 minutes by only utilizing about 21% of the slices.
author:
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Hendrik
full_name: Hangmann, Hendrik
last_name: Hangmann
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: 'Happe M, Hangmann H, Agne A, Plessl C. Eight Ways to put your FPGA on Fire
– A Systematic Study of Heat Generators. In: Proceedings of the International
Conference on Reconfigurable Computing and FPGAs (ReConFig). IEEE; 2012:1-8.
doi:10.1109/ReConFig.2012.6416745'
apa: Happe, M., Hangmann, H., Agne, A., & Plessl, C. (2012). Eight Ways to put
your FPGA on Fire – A Systematic Study of Heat Generators. Proceedings of the
International Conference on Reconfigurable Computing and FPGAs (ReConFig),
1–8. https://doi.org/10.1109/ReConFig.2012.6416745
bibtex: '@inproceedings{Happe_Hangmann_Agne_Plessl_2012, title={Eight Ways to put
your FPGA on Fire – A Systematic Study of Heat Generators}, DOI={10.1109/ReConFig.2012.6416745},
booktitle={Proceedings of the International Conference on Reconfigurable Computing
and FPGAs (ReConFig)}, publisher={IEEE}, author={Happe, Markus and Hangmann, Hendrik
and Agne, Andreas and Plessl, Christian}, year={2012}, pages={1–8} }'
chicago: Happe, Markus, Hendrik Hangmann, Andreas Agne, and Christian Plessl. “Eight
Ways to Put Your FPGA on Fire – A Systematic Study of Heat Generators.” In Proceedings
of the International Conference on Reconfigurable Computing and FPGAs (ReConFig),
1–8. IEEE, 2012. https://doi.org/10.1109/ReConFig.2012.6416745.
ieee: 'M. Happe, H. Hangmann, A. Agne, and C. Plessl, “Eight Ways to put your FPGA
on Fire – A Systematic Study of Heat Generators,” in Proceedings of the International
Conference on Reconfigurable Computing and FPGAs (ReConFig), 2012, pp. 1–8,
doi: 10.1109/ReConFig.2012.6416745.'
mla: Happe, Markus, et al. “Eight Ways to Put Your FPGA on Fire – A Systematic Study
of Heat Generators.” Proceedings of the International Conference on Reconfigurable
Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8, doi:10.1109/ReConFig.2012.6416745.
short: 'M. Happe, H. Hangmann, A. Agne, C. Plessl, in: Proceedings of the International
Conference on Reconfigurable Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8.'
date_created: 2017-10-17T12:42:51Z
date_updated: 2023-09-26T13:42:26Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ReConFig.2012.6416745
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T06:48:32Z
date_updated: 2018-03-15T06:48:32Z
file_id: '1246'
file_name: 615-ReConFig12_01.pdf
file_size: 730144
relation: main_file
success: 1
file_date_updated: 2018-03-15T06:48:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-8
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: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: Proceedings of the International Conference on Reconfigurable Computing
and FPGAs (ReConFig)
publisher: IEEE
quality_controlled: '1'
status: public
title: Eight Ways to put your FPGA on Fire – A Systematic Study of Heat Generators
type: conference
user_id: '15278'
year: '2012'
...
---
_id: '591'
abstract:
- lang: eng
text: One major obstacle for a wide spread FPGA usage in general-purpose computing
is the development tool flow that requires much higher effort than for pure software
solutions. Convey Computer promises a solution to this problem for their HC-1
platform, where the FPGAs are configured to run as a vector processor and the software
source code can be annotated with pragmas that guide an automated vectorization
process. We investigate this approach for a stereo matching algorithm that has
abundant parallelism and a number of different computational patterns. We note
that for this case study the automated vectorization in its current state doesn’t
hold its productivity promise. However, we also show that using the Vector Personality
can yield a significant speedups compared to CPU implementations in two of three
investigated phases of the algorithm. Those speedups don’t match custom FPGA implementations,
but can come with much reduced development effort.
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
- first_name: Henning
full_name: Schmitz, Henning
last_name: Schmitz
citation:
ama: 'Kenter T, Plessl C, Schmitz H. Pragma based parallelization - Trading hardware
efficiency for ease of use? In: Proceedings of the International Conference
on ReConFigurable Computing and FPGAs (ReConFig). IEEE; 2012:1-8. doi:10.1109/ReConFig.2012.6416773'
apa: Kenter, T., Plessl, C., & Schmitz, H. (2012). Pragma based parallelization
- Trading hardware efficiency for ease of use? Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 1–8. https://doi.org/10.1109/ReConFig.2012.6416773
bibtex: '@inproceedings{Kenter_Plessl_Schmitz_2012, title={Pragma based parallelization
- Trading hardware efficiency for ease of use?}, DOI={10.1109/ReConFig.2012.6416773},
booktitle={Proceedings of the International Conference on ReConFigurable Computing
and FPGAs (ReConFig)}, publisher={IEEE}, author={Kenter, Tobias and Plessl, Christian
and Schmitz, Henning}, year={2012}, pages={1–8} }'
chicago: Kenter, Tobias, Christian Plessl, and Henning Schmitz. “Pragma Based Parallelization
- Trading Hardware Efficiency for Ease of Use?” In Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 1–8. IEEE, 2012.
https://doi.org/10.1109/ReConFig.2012.6416773.
ieee: 'T. Kenter, C. Plessl, and H. Schmitz, “Pragma based parallelization - Trading
hardware efficiency for ease of use?,” in Proceedings of the International
Conference on ReConFigurable Computing and FPGAs (ReConFig), 2012, pp. 1–8,
doi: 10.1109/ReConFig.2012.6416773.'
mla: Kenter, Tobias, et al. “Pragma Based Parallelization - Trading Hardware Efficiency
for Ease of Use?” Proceedings of the International Conference on ReConFigurable
Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8, doi:10.1109/ReConFig.2012.6416773.
short: 'T. Kenter, C. Plessl, H. Schmitz, in: Proceedings of the International Conference
on ReConFigurable Computing and FPGAs (ReConFig), IEEE, 2012, pp. 1–8.'
date_created: 2017-10-17T12:42:47Z
date_updated: 2023-09-26T13:41:08Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
doi: 10.1109/ReConFig.2012.6416773
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:33:18Z
date_updated: 2018-03-15T08:33:18Z
file_id: '1257'
file_name: 591-ReConFig2012Kenter_Schmitz_Plessl.pdf
file_size: 371235
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:33:18Z
has_accepted_license: '1'
language:
- iso: eng
page: 1-8
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: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: Proceedings of the International Conference on ReConFigurable Computing
and FPGAs (ReConFig)
publisher: IEEE
quality_controlled: '1'
status: public
title: Pragma based parallelization - Trading hardware efficiency for ease of use?
type: conference
user_id: '15278'
year: '2012'
...
---
_id: '609'
abstract:
- lang: eng
text: Today's design and operation principles and methods do not scale well with
future reconfigurable computing systems due to an increased complexity in system
architectures and applications, run-time dynamics and corresponding requirements.
Hence, novel design and operation principles and methods are needed that possibly
break drastically with the static ones we have built into our systems and the
fixed abstraction layers we have cherished over the last decades. Thus, we propose
a HW/SW platform that collects and maintains information about its state and progress
which enables the system to reason about its behavior (self-awareness) and utilizes
its knowledge to effectively and autonomously adapt its behavior to changing requirements
(self-expression).To enable self-awareness, our compute nodes collect information
using a variety of sensors, i.e. performance counters and thermal diodes, and
use internal self-awareness models that process these information. For self-awareness,
on-line learning is crucial such that the node learns and continuously updates
its models at run-time to react to changing conditions. To enable self-expression,
we break with the classic design-time abstraction layers of hardware, operating
system and software. In contrast, our system is able to vertically migrate functionalities
between the layers at run-time to exploit trade-offs between abstraction and optimization.This
paper presents a heterogeneous multi-core architecture, that enables self-awareness
and self-expression, an operating system for our proposed hardware/software platform
and a novel self-expression method.
author:
- first_name: Markus
full_name: Happe, Markus
last_name: Happe
- first_name: Andreas
full_name: Agne, Andreas
last_name: Agne
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Happe M, Agne A, Plessl C, Platzner M. Hardware/Software Platform for Self-aware
Compute Nodes. In: Proceedings of the Workshop on Self-Awareness in Reconfigurable
Computing Systems (SRCS). ; 2012:8-9.'
apa: Happe, M., Agne, A., Plessl, C., & Platzner, M. (2012). Hardware/Software
Platform for Self-aware Compute Nodes. Proceedings of the Workshop on Self-Awareness
in Reconfigurable Computing Systems (SRCS), 8–9.
bibtex: '@inproceedings{Happe_Agne_Plessl_Platzner_2012, title={Hardware/Software
Platform for Self-aware Compute Nodes}, booktitle={Proceedings of the Workshop
on Self-Awareness in Reconfigurable Computing Systems (SRCS)}, author={Happe,
Markus and Agne, Andreas and Plessl, Christian and Platzner, Marco}, year={2012},
pages={8–9} }'
chicago: Happe, Markus, Andreas Agne, Christian Plessl, and Marco Platzner. “Hardware/Software
Platform for Self-Aware Compute Nodes.” In Proceedings of the Workshop on Self-Awareness
in Reconfigurable Computing Systems (SRCS), 8–9, 2012.
ieee: M. Happe, A. Agne, C. Plessl, and M. Platzner, “Hardware/Software Platform
for Self-aware Compute Nodes,” in Proceedings of the Workshop on Self-Awareness
in Reconfigurable Computing Systems (SRCS), 2012, pp. 8–9.
mla: Happe, Markus, et al. “Hardware/Software Platform for Self-Aware Compute Nodes.”
Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing Systems
(SRCS), 2012, pp. 8–9.
short: 'M. Happe, A. Agne, C. Plessl, M. Platzner, in: Proceedings of the Workshop
on Self-Awareness in Reconfigurable Computing Systems (SRCS), 2012, pp. 8–9.'
date_created: 2017-10-17T12:42:50Z
date_updated: 2023-09-26T13:41:36Z
ddc:
- '040'
department:
- _id: '27'
- _id: '518'
- _id: '78'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T08:14:17Z
date_updated: 2018-03-15T08:14:17Z
file_id: '1249'
file_name: 609-happe12_fpl_awareness.pdf
file_size: 146789
relation: main_file
success: 1
file_date_updated: 2018-03-15T08:14:17Z
has_accepted_license: '1'
language:
- iso: eng
page: 8-9
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: '31'
grant_number: '257906'
name: Engineering Proprioception in Computing Systems
publication: Proceedings of the Workshop on Self-Awareness in Reconfigurable Computing
Systems (SRCS)
quality_controlled: '1'
status: public
title: Hardware/Software Platform for Self-aware Compute Nodes
type: conference
user_id: '15278'
year: '2012'
...