---
_id: '48872'
abstract:
- lang: eng
  text: Quality diversity (QD) is a branch of evolutionary computation that gained
    increasing interest in recent years. The Map-Elites QD approach defines a feature
    space, i.e., a partition of the search space, and stores the best solution for
    each cell of this space. We study a simple QD algorithm in the context of pseudo-Boolean
    optimisation on the "number of ones" feature space, where the ith cell stores
    the best solution amongst those with a number of ones in [(i - 1)k, ik - 1]. Here
    k is a granularity parameter 1 {$\leq$} k {$\leq$} n+1. We give a tight bound
    on the expected time until all cells are covered for arbitrary fitness functions
    and for all k and analyse the expected optimisation time of QD on OneMax and other
    problems whose structure aligns favourably with the feature space. On combinatorial
    problems we show that QD finds a (1 - 1/e)-approximation when maximising any monotone
    sub-modular function with a single uniform cardinality constraint efficiently.
    Defining the feature space as the number of connected components of a connected
    graph, we show that QD finds a minimum spanning tree in expected polynomial time.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
citation:
  ama: 'Bossek J, Sudholt D. Runtime Analysis of Quality Diversity Algorithms. In:
    <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO’23.
    Association for Computing Machinery; 2023:1546–1554. doi:<a href="https://doi.org/10.1145/3583131.3590383">10.1145/3583131.3590383</a>'
  apa: Bossek, J., &#38; Sudholt, D. (2023). Runtime Analysis of Quality Diversity
    Algorithms. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>,
    1546–1554. <a href="https://doi.org/10.1145/3583131.3590383">https://doi.org/10.1145/3583131.3590383</a>
  bibtex: '@inproceedings{Bossek_Sudholt_2023, place={New York, NY, USA}, series={GECCO’23},
    title={Runtime Analysis of Quality Diversity Algorithms}, DOI={<a href="https://doi.org/10.1145/3583131.3590383">10.1145/3583131.3590383</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
    publisher={Association for Computing Machinery}, author={Bossek, Jakob and Sudholt,
    Dirk}, year={2023}, pages={1546–1554}, collection={GECCO’23} }'
  chicago: 'Bossek, Jakob, and Dirk Sudholt. “Runtime Analysis of Quality Diversity
    Algorithms.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>,
    1546–1554. GECCO’23. New York, NY, USA: Association for Computing Machinery, 2023.
    <a href="https://doi.org/10.1145/3583131.3590383">https://doi.org/10.1145/3583131.3590383</a>.'
  ieee: 'J. Bossek and D. Sudholt, “Runtime Analysis of Quality Diversity Algorithms,”
    in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>,
    2023, pp. 1546–1554, doi: <a href="https://doi.org/10.1145/3583131.3590383">10.1145/3583131.3590383</a>.'
  mla: Bossek, Jakob, and Dirk Sudholt. “Runtime Analysis of Quality Diversity Algorithms.”
    <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association
    for Computing Machinery, 2023, pp. 1546–1554, doi:<a href="https://doi.org/10.1145/3583131.3590383">10.1145/3583131.3590383</a>.
  short: 'J. Bossek, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation
    Conference, Association for Computing Machinery, New York, NY, USA, 2023, pp.
    1546–1554.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:48:26Z
department:
- _id: '819'
doi: 10.1145/3583131.3590383
extern: '1'
keyword:
- quality diversity
- runtime analysis
language:
- iso: eng
page: 1546–1554
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
  isbn:
  - '9798400701191'
publisher: Association for Computing Machinery
series_title: GECCO’23
status: public
title: Runtime Analysis of Quality Diversity Algorithms
type: conference
user_id: '102979'
year: '2023'
...
---
_id: '48871'
abstract:
- lang: eng
  text: 'Most runtime analyses of randomised search heuristics focus on the expected
    number of function evaluations to find a unique global optimum. We ask a fundamental
    question: if additional search points are declared optimal, or declared as desirable
    target points, do these additional optima speed up evolutionary algorithms? More
    formally, we analyse the expected hitting time of a target set OPT{$\cup$}S where
    S is a set of non-optimal search points and OPT is the set of optima and compare
    it to the expected hitting time of OPT. We show that the answer to our question
    depends on the number and placement of search points in S. For all black-box algorithms
    and all fitness functions with polynomial expected optimisation times we show
    that, if additional optima are placed randomly, even an exponential number of
    optima has a negligible effect on the expected optimisation time. Considering
    Hamming balls around all global optima gives an easier target for some algorithms
    and functions and can shift the phase transition with respect to offspring population
    sizes in the (1,{$\lambda$}) EA on OneMax. However, for the one-dimensional Ising
    model the time to reach Hamming balls of radius (1/2-{$ϵ$})n around optima does
    not reduce the asymptotic expected optimisation time in the worst case. Finally,
    on functions where search trajectories typically join in a single search point,
    turning one search point into an optimum drastically reduces the expected optimisation
    time.'
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
citation:
  ama: Bossek J, Sudholt D. Do Additional Target Points Speed Up Evolutionary Algorithms?
    <i>Theoretical Computer Science</i>. Published online 2023:113757. doi:<a href="https://doi.org/10.1016/j.tcs.2023.113757">10.1016/j.tcs.2023.113757</a>
  apa: Bossek, J., &#38; Sudholt, D. (2023). Do Additional Target Points Speed Up
    Evolutionary Algorithms? <i>Theoretical Computer Science</i>, 113757. <a href="https://doi.org/10.1016/j.tcs.2023.113757">https://doi.org/10.1016/j.tcs.2023.113757</a>
  bibtex: '@article{Bossek_Sudholt_2023, title={Do Additional Target Points Speed
    Up Evolutionary Algorithms?}, DOI={<a href="https://doi.org/10.1016/j.tcs.2023.113757">10.1016/j.tcs.2023.113757</a>},
    journal={Theoretical Computer Science}, author={Bossek, Jakob and Sudholt, Dirk},
    year={2023}, pages={113757} }'
  chicago: Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up
    Evolutionary Algorithms?” <i>Theoretical Computer Science</i>, 2023, 113757. <a
    href="https://doi.org/10.1016/j.tcs.2023.113757">https://doi.org/10.1016/j.tcs.2023.113757</a>.
  ieee: 'J. Bossek and D. Sudholt, “Do Additional Target Points Speed Up Evolutionary
    Algorithms?,” <i>Theoretical Computer Science</i>, p. 113757, 2023, doi: <a href="https://doi.org/10.1016/j.tcs.2023.113757">10.1016/j.tcs.2023.113757</a>.'
  mla: Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up Evolutionary
    Algorithms?” <i>Theoretical Computer Science</i>, 2023, p. 113757, doi:<a href="https://doi.org/10.1016/j.tcs.2023.113757">10.1016/j.tcs.2023.113757</a>.
  short: J. Bossek, D. Sudholt, Theoretical Computer Science (2023) 113757.
date_created: 2023-11-14T15:58:56Z
date_updated: 2023-12-13T10:51:07Z
department:
- _id: '819'
doi: 10.1016/j.tcs.2023.113757
keyword:
- Evolutionary algorithms
- pseudo-Boolean functions
- runtime analysis
language:
- iso: eng
page: '113757'
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
status: public
title: Do Additional Target Points Speed Up Evolutionary Algorithms?
type: journal_article
user_id: '102979'
year: '2023'
...
---
_id: '48860'
abstract:
- lang: eng
  text: In the area of evolutionary computation the calculation of diverse sets of
    high-quality solutions to a given optimization problem has gained momentum in
    recent years under the term evolutionary diversity optimization. Theoretical insights
    into the working principles of baseline evolutionary algorithms for diversity
    optimization are still rare. In this paper we study the well-known Minimum Spanning
    Tree problem (MST) in the context of diversity optimization where population diversity
    is measured by the sum of pairwise edge overlaps. Theoretical results provide
    insights into the fitness landscape of the MST diversity optimization problem
    pointing out that even for a population of {$\mu$} = 2 fitness plateaus (of constant
    length) can be reached, but nevertheless diverse sets can be calculated in polynomial
    time. We supplement our theoretical results with a series of experiments for the
    unconstrained and constraint case where all solutions need to fulfill a minimal
    quality threshold. Our results show that a simple ({$\mu$} + 1)-EA can effectively
    compute a diversified population of spanning trees of high quality.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Frank
  full_name: Neumann, Frank
  last_name: Neumann
citation:
  ama: 'Bossek J, Neumann F. Evolutionary Diversity Optimization and the Minimum Spanning
    Tree Problem. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>.
    GECCO ’21. Association for Computing Machinery; 2021:198–206. doi:<a href="https://doi.org/10.1145/3449639.3459363">10.1145/3449639.3459363</a>'
  apa: Bossek, J., &#38; Neumann, F. (2021). Evolutionary Diversity Optimization and
    the Minimum Spanning Tree Problem. <i>Proceedings of the Genetic and Evolutionary
    Computation Conference</i>, 198–206. <a href="https://doi.org/10.1145/3449639.3459363">https://doi.org/10.1145/3449639.3459363</a>
  bibtex: '@inproceedings{Bossek_Neumann_2021, place={New York, NY, USA}, series={GECCO
    ’21}, title={Evolutionary Diversity Optimization and the Minimum Spanning Tree
    Problem}, DOI={<a href="https://doi.org/10.1145/3449639.3459363">10.1145/3449639.3459363</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
    publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
    Frank}, year={2021}, pages={198–206}, collection={GECCO ’21} }'
  chicago: 'Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization
    and the Minimum Spanning Tree Problem.” In <i>Proceedings of the Genetic and Evolutionary
    Computation Conference</i>, 198–206. GECCO ’21. New York, NY, USA: Association
    for Computing Machinery, 2021. <a href="https://doi.org/10.1145/3449639.3459363">https://doi.org/10.1145/3449639.3459363</a>.'
  ieee: 'J. Bossek and F. Neumann, “Evolutionary Diversity Optimization and the Minimum
    Spanning Tree Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation
    Conference</i>, 2021, pp. 198–206, doi: <a href="https://doi.org/10.1145/3449639.3459363">10.1145/3449639.3459363</a>.'
  mla: Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and
    the Minimum Spanning Tree Problem.” <i>Proceedings of the Genetic and Evolutionary
    Computation Conference</i>, Association for Computing Machinery, 2021, pp. 198–206,
    doi:<a href="https://doi.org/10.1145/3449639.3459363">10.1145/3449639.3459363</a>.
  short: 'J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation
    Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp.
    198–206.'
date_created: 2023-11-14T15:58:55Z
date_updated: 2023-12-13T10:45:37Z
department:
- _id: '819'
doi: 10.1145/3449639.3459363
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimization
- minimum spanning tree
- runtime analysis
language:
- iso: eng
page: 198–206
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
  isbn:
  - 978-1-4503-8350-9
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’21
status: public
title: Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48862'
abstract:
- lang: eng
  text: 'Most runtime analyses of randomised search heuristics focus on the expected
    number of function evaluations to find a unique global optimum. We ask a fundamental
    question: if additional search points are declared optimal, or declared as desirable
    target points, do these additional optima speed up evolutionary algorithms? More
    formally, we analyse the expected hitting time of a target set OPT {$\cup$} S
    where S is a set of non-optimal search points and OPT is the set of optima and
    compare it to the expected hitting time of OPT. We show that the answer to our
    question depends on the number and placement of search points in S. For all black-box
    algorithms and all fitness functions we show that, if additional optima are placed
    randomly, even an exponential number of optima has a negligible effect on the
    expected optimisation time. Considering Hamming balls around all global optima
    gives an easier target for some algorithms and functions and can shift the phase
    transition with respect to offspring population sizes in the (1,{$\lambda$}) EA
    on One-Max. Finally, on functions where search trajectories typically join in
    a single search point, turning one search point into an optimum drastically reduces
    the expected optimisation time.'
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
citation:
  ama: 'Bossek J, Sudholt D. Do Additional Optima Speed up Evolutionary Algorithms?
    In: <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
    Algorithms</i>. Association for Computing Machinery; 2021:1–11.'
  apa: Bossek, J., &#38; Sudholt, D. (2021). Do Additional Optima Speed up Evolutionary
    Algorithms? In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations
    of Genetic Algorithms</i> (pp. 1–11). Association for Computing Machinery.
  bibtex: '@inbook{Bossek_Sudholt_2021, place={New York, NY, USA}, title={Do Additional
    Optima Speed up Evolutionary Algorithms?}, booktitle={Proceedings of the 16th
    ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association
    for Computing Machinery}, author={Bossek, Jakob and Sudholt, Dirk}, year={2021},
    pages={1–11} }'
  chicago: 'Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary
    Algorithms?” In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations
    of Genetic Algorithms</i>, 1–11. New York, NY, USA: Association for Computing
    Machinery, 2021.'
  ieee: 'J. Bossek and D. Sudholt, “Do Additional Optima Speed up Evolutionary Algorithms?,”
    in <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
    Algorithms</i>, New York, NY, USA: Association for Computing Machinery, 2021,
    pp. 1–11.'
  mla: Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary
    Algorithms?” <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of
    Genetic Algorithms</i>, Association for Computing Machinery, 2021, pp. 1–11.
  short: 'J. Bossek, D. Sudholt, in: Proceedings of the 16th ACM/SIGEVO Conference
    on Foundations of Genetic Algorithms, Association for Computing Machinery, New
    York, NY, USA, 2021, pp. 1–11.'
date_created: 2023-11-14T15:58:55Z
date_updated: 2023-12-13T10:45:31Z
department:
- _id: '819'
extern: '1'
keyword:
- evolutionary algorithms
- pseudo-boolean functions
- runtime analysis
- theory
language:
- iso: eng
page: 1–11
place: New York, NY, USA
publication: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
  Algorithms
publication_identifier:
  isbn:
  - 978-1-4503-8352-3
publication_status: published
publisher: Association for Computing Machinery
status: public
title: Do Additional Optima Speed up Evolutionary Algorithms?
type: book_chapter
user_id: '102979'
year: '2021'
...
---
_id: '18249'
abstract:
- lang: eng
  text: Augmented Reality (AR) has recently found high attention in mobile shopping
    apps such as in domains like furniture or decoration. Here, the developers of
    the apps focus on the positioning of atomic 3D objects in the physical environment.
    With this focus, they neglect the configuration of multi-faceted 3D object composition
    according to the user needs and environmental constraints. To tackle these challenges,
    we present a model-based approach to support AR-assisted product con-figuration
    based on the concept of Dynamic Software Product Lines. Our approach splits products
    (e.g. table) into parts (e.g. tabletop, ta-ble legs, funnier) with their 3D objects
    and additional information (e.g. name, price). The possible products, which can
    be configured out of these parts, are stored in a feature model. At runtime, this
    feature model can be used to configure 3D object compositions out of the product
    parts and adapt to user needs and environmental constraints. The benefits of this
    approach are demonstrated by a case study of configuring modular kitchens with
    the help of a prototypical mobile-based implementation.
author:
- first_name: Sebastian
  full_name: Gottschalk, Sebastian
  id: '47208'
  last_name: Gottschalk
- first_name: Enes
  full_name: Yigitbas, Enes
  id: '8447'
  last_name: Yigitbas
  orcid: 0000-0002-5967-833X
- first_name: Eugen
  full_name: Schmidt, Eugen
  last_name: Schmidt
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
citation:
  ama: 'Gottschalk S, Yigitbas E, Schmidt E, Engels G. Model-based Product Configuration
    in Augmented Reality Applications. In: Bernhaupt R, Ardito C, Sauer S, eds. <i>Human-Centered
    Software Engineering. HCSE 2020</i>. Vol 12481. Lecture Notes in Computer Science.
    Cham: Springer; 2020. doi:<a href="https://doi.org/10.1007/978-3-030-64266-2_5">10.1007/978-3-030-64266-2_5</a>'
  apa: 'Gottschalk, S., Yigitbas, E., Schmidt, E., &#38; Engels, G. (2020). Model-based
    Product Configuration in Augmented Reality Applications. In R. Bernhaupt, C. Ardito,
    &#38; S. Sauer (Eds.), <i>Human-Centered Software Engineering. HCSE 2020</i> (Vol.
    12481). Cham: Springer. <a href="https://doi.org/10.1007/978-3-030-64266-2_5">https://doi.org/10.1007/978-3-030-64266-2_5</a>'
  bibtex: '@inproceedings{Gottschalk_Yigitbas_Schmidt_Engels_2020, place={Cham}, series={Lecture
    Notes in Computer Science}, title={Model-based Product Configuration in Augmented
    Reality Applications}, volume={12481}, DOI={<a href="https://doi.org/10.1007/978-3-030-64266-2_5">10.1007/978-3-030-64266-2_5</a>},
    booktitle={Human-Centered Software Engineering. HCSE 2020}, publisher={Springer},
    author={Gottschalk, Sebastian and Yigitbas, Enes and Schmidt, Eugen and Engels,
    Gregor}, editor={Bernhaupt, Regina and Ardito, Carmelo and Sauer, StefanEditors},
    year={2020}, collection={Lecture Notes in Computer Science} }'
  chicago: 'Gottschalk, Sebastian, Enes Yigitbas, Eugen Schmidt, and Gregor Engels.
    “Model-Based Product Configuration in Augmented Reality Applications.” In <i>Human-Centered
    Software Engineering. HCSE 2020</i>, edited by Regina Bernhaupt, Carmelo Ardito,
    and Stefan Sauer, Vol. 12481. Lecture Notes in Computer Science. Cham: Springer,
    2020. <a href="https://doi.org/10.1007/978-3-030-64266-2_5">https://doi.org/10.1007/978-3-030-64266-2_5</a>.'
  ieee: S. Gottschalk, E. Yigitbas, E. Schmidt, and G. Engels, “Model-based Product
    Configuration in Augmented Reality Applications,” in <i>Human-Centered Software
    Engineering. HCSE 2020</i>, Eindhoven, 2020, vol. 12481.
  mla: Gottschalk, Sebastian, et al. “Model-Based Product Configuration in Augmented
    Reality Applications.” <i>Human-Centered Software Engineering. HCSE 2020</i>,
    edited by Regina Bernhaupt et al., vol. 12481, Springer, 2020, doi:<a href="https://doi.org/10.1007/978-3-030-64266-2_5">10.1007/978-3-030-64266-2_5</a>.
  short: 'S. Gottschalk, E. Yigitbas, E. Schmidt, G. Engels, in: R. Bernhaupt, C.
    Ardito, S. Sauer (Eds.), Human-Centered Software Engineering. HCSE 2020, Springer,
    Cham, 2020.'
conference:
  end_date: 2020-12-02
  location: Eindhoven
  name: 8th International Working Conference on Human-Centered Software Engineering
    (HCSE'20)
  start_date: 2020-11-30
date_created: 2020-08-25T08:27:38Z
date_updated: 2022-01-06T06:53:28Z
ddc:
- '000'
department:
- _id: '66'
- _id: '534'
doi: 10.1007/978-3-030-64266-2_5
editor:
- first_name: Regina
  full_name: Bernhaupt, Regina
  last_name: Bernhaupt
- first_name: Carmelo
  full_name: Ardito, Carmelo
  last_name: Ardito
- first_name: Stefan
  full_name: Sauer, Stefan
  last_name: Sauer
file:
- access_level: open_access
  content_type: application/pdf
  creator: sego
  date_created: 2020-11-30T08:33:30Z
  date_updated: 2020-11-30T08:36:52Z
  file_id: '20541'
  file_name: HCSE20_full.pdf
  file_size: 2258601
  relation: main_file
file_date_updated: 2020-11-30T08:36:52Z
has_accepted_license: '1'
intvolume: '     12481'
keyword:
- Product Configuration
- Augmented Reality
- Runtime Adaptation
- Dynamic Software Product Lines
language:
- iso: eng
oa: '1'
place: Cham
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '17'
  name: SFB 901 - Subproject C5
publication: Human-Centered Software Engineering. HCSE 2020
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Model-based Product Configuration in Augmented Reality Applications
type: conference
user_id: '47208'
volume: 12481
year: '2020'
...
---
_id: '48895'
abstract:
- lang: eng
  text: Evolutionary algorithms (EAs) are general-purpose problem solvers that usually
    perform an unbiased search. This is reasonable and desirable in a black-box scenario.
    For combinatorial optimization problems, often more knowledge about the structure
    of optimal solutions is given, which can be leveraged by means of biased search
    operators. We consider the Minimum Spanning Tree (MST) problem in a single- and
    multi-objective version, and introduce a biased mutation, which puts more emphasis
    on the selection of edges of low rank in terms of low domination number. We present
    example graphs where the biased mutation can significantly speed up the expected
    runtime until (Pareto-)optimal solutions are found. On the other hand, we demonstrate
    that bias can lead to exponential runtime if "heavy" edges are necessarily part
    of an optimal solution. However, on general graphs in the single-objective setting,
    we show that a combined mutation operator which decides for unbiased or biased
    edge selection in each step with equal probability exhibits a polynomial upper
    bound - as unbiased mutation - in the worst case and benefits from bias if the
    circumstances are favorable.
author:
- first_name: Vahid
  full_name: Roostapour, Vahid
  last_name: Roostapour
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Frank
  full_name: Neumann, Frank
  last_name: Neumann
citation:
  ama: 'Roostapour V, Bossek J, Neumann F. Runtime Analysis of Evolutionary Algorithms
    with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. In:
    <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>.
    {GECCO} ’20. Association for Computing Machinery; 2020:551–559. doi:<a href="https://doi.org/10.1145/3377930.3390168">10.1145/3377930.3390168</a>'
  apa: Roostapour, V., Bossek, J., &#38; Neumann, F. (2020). Runtime Analysis of Evolutionary
    Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree
    Problem. <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>,
    551–559. <a href="https://doi.org/10.1145/3377930.3390168">https://doi.org/10.1145/3377930.3390168</a>
  bibtex: '@inproceedings{Roostapour_Bossek_Neumann_2020, place={New York, NY, USA},
    series={{GECCO} ’20}, title={Runtime Analysis of Evolutionary Algorithms with
    Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem}, DOI={<a
    href="https://doi.org/10.1145/3377930.3390168">10.1145/3377930.3390168</a>}, booktitle={Proceedings
    of the 2020 Genetic and Evolutionary Computation Conference}, publisher={Association
    for Computing Machinery}, author={Roostapour, Vahid and Bossek, Jakob and Neumann,
    Frank}, year={2020}, pages={551–559}, collection={{GECCO} ’20} }'
  chicago: 'Roostapour, Vahid, Jakob Bossek, and Frank Neumann. “Runtime Analysis
    of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum
    Spanning Tree Problem.” In <i>Proceedings of the 2020 Genetic and Evolutionary
    Computation Conference</i>, 551–559. {GECCO} ’20. New York, NY, USA: Association
    for Computing Machinery, 2020. <a href="https://doi.org/10.1145/3377930.3390168">https://doi.org/10.1145/3377930.3390168</a>.'
  ieee: 'V. Roostapour, J. Bossek, and F. Neumann, “Runtime Analysis of Evolutionary
    Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree
    Problem,” in <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>,
    2020, pp. 551–559, doi: <a href="https://doi.org/10.1145/3377930.3390168">10.1145/3377930.3390168</a>.'
  mla: Roostapour, Vahid, et al. “Runtime Analysis of Evolutionary Algorithms with
    Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.” <i>Proceedings
    of the 2020 Genetic and Evolutionary Computation Conference</i>, Association for
    Computing Machinery, 2020, pp. 551–559, doi:<a href="https://doi.org/10.1145/3377930.3390168">10.1145/3377930.3390168</a>.
  short: 'V. Roostapour, J. Bossek, F. Neumann, in: Proceedings of the 2020 Genetic
    and Evolutionary Computation Conference, Association for Computing Machinery,
    New York, NY, USA, 2020, pp. 551–559.'
date_created: 2023-11-14T15:59:00Z
date_updated: 2023-12-13T10:49:38Z
department:
- _id: '819'
doi: 10.1145/3377930.3390168
extern: '1'
keyword:
- biased mutation
- evolutionary algorithms
- minimum spanning tree problem
- runtime analysis
language:
- iso: eng
page: 551–559
place: New York, NY, USA
publication: Proceedings of the 2020 Genetic and Evolutionary Computation Conference
publication_identifier:
  isbn:
  - 978-1-4503-7128-5
publisher: Association for Computing Machinery
series_title: '{GECCO} ’20'
status: public
title: Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective
  Minimum Spanning Tree Problem
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48870'
abstract:
- lang: eng
  text: The edge coloring problem asks for an assignment of colors to edges of a graph
    such that no two incident edges share the same color and the number of colors
    is minimized. It is known that all graphs with maximum degree {$\Delta$} can be
    colored with {$\Delta$} or {$\Delta$} + 1 colors, but it is NP-hard to determine
    whether {$\Delta$} colors are sufficient. We present the first runtime analysis
    of evolutionary algorithms (EAs) for the edge coloring problem. Simple EAs such
    as RLS and (1+1) EA efficiently find (2{$\Delta$} - 1)-colorings on arbitrary
    graphs and optimal colorings for even and odd cycles, paths, star graphs and arbitrary
    trees. A partial analysis for toroids also suggests efficient runtimes in bipartite
    graphs with many cycles. Experiments support these findings and investigate additional
    graph classes such as hypercubes, complete graphs and complete bipartite graphs.
    Theoretical and experimental results suggest that simple EAs find optimal colorings
    for all these graph classes in expected time O({$\Delta\mathscrl$}2m log m), where
    m is the number of edges and {$\mathscrl$} is the length of the longest simple
    path in the graph.
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
citation:
  ama: 'Bossek J, Sudholt D. Time Complexity Analysis of RLS and (1 + 1) EA for the
    Edge Coloring Problem. In: <i>Proceedings of the 15th ACM/SIGEVO Conference on
    Foundations of Genetic Algorithms</i>. FOGA ’19. Association for Computing Machinery;
    2019:102–115. doi:<a href="https://doi.org/10.1145/3299904.3340311">10.1145/3299904.3340311</a>'
  apa: Bossek, J., &#38; Sudholt, D. (2019). Time Complexity Analysis of RLS and (1
    + 1) EA for the Edge Coloring Problem. <i>Proceedings of the 15th ACM/SIGEVO Conference
    on Foundations of Genetic Algorithms</i>, 102–115. <a href="https://doi.org/10.1145/3299904.3340311">https://doi.org/10.1145/3299904.3340311</a>
  bibtex: '@inproceedings{Bossek_Sudholt_2019, place={New York, NY, USA}, series={FOGA
    ’19}, title={Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring
    Problem}, DOI={<a href="https://doi.org/10.1145/3299904.3340311">10.1145/3299904.3340311</a>},
    booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
    Algorithms}, publisher={Association for Computing Machinery}, author={Bossek,
    Jakob and Sudholt, Dirk}, year={2019}, pages={102–115}, collection={FOGA ’19}
    }'
  chicago: 'Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and
    (1 + 1) EA for the Edge Coloring Problem.” In <i>Proceedings of the 15th ACM/SIGEVO
    Conference on Foundations of Genetic Algorithms</i>, 102–115. FOGA ’19. New York,
    NY, USA: Association for Computing Machinery, 2019. <a href="https://doi.org/10.1145/3299904.3340311">https://doi.org/10.1145/3299904.3340311</a>.'
  ieee: 'J. Bossek and D. Sudholt, “Time Complexity Analysis of RLS and (1 + 1) EA
    for the Edge Coloring Problem,” in <i>Proceedings of the 15th ACM/SIGEVO Conference
    on Foundations of Genetic Algorithms</i>, 2019, pp. 102–115, doi: <a href="https://doi.org/10.1145/3299904.3340311">10.1145/3299904.3340311</a>.'
  mla: Bossek, Jakob, and Dirk Sudholt. “Time Complexity Analysis of RLS and (1 +
    1) EA for the Edge Coloring Problem.” <i>Proceedings of the 15th ACM/SIGEVO Conference
    on Foundations of Genetic Algorithms</i>, Association for Computing Machinery,
    2019, pp. 102–115, doi:<a href="https://doi.org/10.1145/3299904.3340311">10.1145/3299904.3340311</a>.
  short: 'J. Bossek, D. Sudholt, in: Proceedings of the 15th ACM/SIGEVO Conference
    on Foundations of Genetic Algorithms, Association for Computing Machinery, New
    York, NY, USA, 2019, pp. 102–115.'
date_created: 2023-11-14T15:58:56Z
date_updated: 2023-12-13T10:46:12Z
department:
- _id: '819'
doi: 10.1145/3299904.3340311
extern: '1'
keyword:
- edge coloring problem
- runtime analysis
language:
- iso: eng
page: 102–115
place: New York, NY, USA
publication: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
  Algorithms
publication_identifier:
  isbn:
  - 978-1-4503-6254-2
publication_status: published
publisher: Association for Computing Machinery
series_title: FOGA ’19
status: public
title: Time Complexity Analysis of RLS and (1 + 1) EA for the Edge Coloring Problem
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '10780'
author:
- first_name: Zakarya
  full_name: Guettatfi, Zakarya
  last_name: Guettatfi
- first_name: Philipp
  full_name: Hübner, Philipp
  last_name: Hübner
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
- first_name: Bernhard
  full_name: Rinner, Bernhard
  last_name: Rinner
citation:
  ama: 'Guettatfi Z, Hübner P, Platzner M, Rinner B. Computational self-awareness
    as design approach for visual sensor nodes. In: <i>12th International Symposium
    on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC)</i>. ; 2017:1-8.
    doi:<a href="https://doi.org/10.1109/ReCoSoC.2017.8016147">10.1109/ReCoSoC.2017.8016147</a>'
  apa: Guettatfi, Z., Hübner, P., Platzner, M., &#38; Rinner, B. (2017). Computational
    self-awareness as design approach for visual sensor nodes. In <i>12th International
    Symposium on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)</i>
    (pp. 1–8). <a href="https://doi.org/10.1109/ReCoSoC.2017.8016147">https://doi.org/10.1109/ReCoSoC.2017.8016147</a>
  bibtex: '@inproceedings{Guettatfi_Hübner_Platzner_Rinner_2017, title={Computational
    self-awareness as design approach for visual sensor nodes}, DOI={<a href="https://doi.org/10.1109/ReCoSoC.2017.8016147">10.1109/ReCoSoC.2017.8016147</a>},
    booktitle={12th International Symposium on Reconfigurable Communication-centric
    Systems-on-Chip (ReCoSoC)}, author={Guettatfi, Zakarya and Hübner, Philipp and
    Platzner, Marco and Rinner, Bernhard}, year={2017}, pages={1–8} }'
  chicago: Guettatfi, Zakarya, Philipp Hübner, Marco Platzner, and Bernhard Rinner.
    “Computational Self-Awareness as Design Approach for Visual Sensor Nodes.” In
    <i>12th International Symposium on Reconfigurable Communication-Centric Systems-on-Chip
    (ReCoSoC)</i>, 1–8, 2017. <a href="https://doi.org/10.1109/ReCoSoC.2017.8016147">https://doi.org/10.1109/ReCoSoC.2017.8016147</a>.
  ieee: Z. Guettatfi, P. Hübner, M. Platzner, and B. Rinner, “Computational self-awareness
    as design approach for visual sensor nodes,” in <i>12th International Symposium
    on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)</i>, 2017, pp.
    1–8.
  mla: Guettatfi, Zakarya, et al. “Computational Self-Awareness as Design Approach
    for Visual Sensor Nodes.” <i>12th International Symposium on Reconfigurable Communication-Centric
    Systems-on-Chip (ReCoSoC)</i>, 2017, pp. 1–8, doi:<a href="https://doi.org/10.1109/ReCoSoC.2017.8016147">10.1109/ReCoSoC.2017.8016147</a>.
  short: 'Z. Guettatfi, P. Hübner, M. Platzner, B. Rinner, in: 12th International
    Symposium on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC), 2017,
    pp. 1–8.'
date_created: 2019-07-10T12:13:15Z
date_updated: 2022-01-06T06:50:50Z
department:
- _id: '78'
doi: 10.1109/ReCoSoC.2017.8016147
keyword:
- embedded systems
- image sensors
- power aware computing
- wireless sensor networks
- Zynq-based VSN node prototype
- computational self-awareness
- design approach
- platform levels
- power consumption
- visual sensor networks
- visual sensor nodes
- Cameras
- Hardware
- Middleware
- Multicore processing
- Operating systems
- Runtime
- Reconfigurable platforms
- distributed embedded systems
- performance-resource trade-off
- self-awareness
- visual sensor nodes
language:
- iso: eng
page: 1-8
publication: 12th International Symposium on Reconfigurable Communication-centric
  Systems-on-Chip (ReCoSoC)
status: public
title: Computational self-awareness as design approach for visual sensor nodes
type: conference
user_id: '3118'
year: '2017'
...
---
_id: '10620'
author:
- first_name: Jahanzeb
  full_name: Anwer, Jahanzeb
  last_name: Anwer
- first_name: Sebastian
  full_name: Meisner, Sebastian
  last_name: Meisner
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Anwer J, Meisner S, Platzner M. Dynamic reliability management: Reconfiguring
    reliability-levels of hardware designs at runtime. In: <i>Reconfigurable Computing
    and FPGAs (ReConFig), 2013 International Conference On</i>. ; 2013:1-6. doi:<a
    href="https://doi.org/10.1109/ReConFig.2013.6732280">10.1109/ReConFig.2013.6732280</a>'
  apa: 'Anwer, J., Meisner, S., &#38; Platzner, M. (2013). Dynamic reliability management:
    Reconfiguring reliability-levels of hardware designs at runtime. In <i>Reconfigurable
    Computing and FPGAs (ReConFig), 2013 International Conference on</i> (pp. 1–6).
    <a href="https://doi.org/10.1109/ReConFig.2013.6732280">https://doi.org/10.1109/ReConFig.2013.6732280</a>'
  bibtex: '@inproceedings{Anwer_Meisner_Platzner_2013, title={Dynamic reliability
    management: Reconfiguring reliability-levels of hardware designs at runtime},
    DOI={<a href="https://doi.org/10.1109/ReConFig.2013.6732280">10.1109/ReConFig.2013.6732280</a>},
    booktitle={Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference
    on}, author={Anwer, Jahanzeb and Meisner, Sebastian and Platzner, Marco}, year={2013},
    pages={1–6} }'
  chicago: 'Anwer, Jahanzeb, Sebastian Meisner, and Marco Platzner. “Dynamic Reliability
    Management: Reconfiguring Reliability-Levels of Hardware Designs at Runtime.”
    In <i>Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference
    On</i>, 1–6, 2013. <a href="https://doi.org/10.1109/ReConFig.2013.6732280">https://doi.org/10.1109/ReConFig.2013.6732280</a>.'
  ieee: 'J. Anwer, S. Meisner, and M. Platzner, “Dynamic reliability management: Reconfiguring
    reliability-levels of hardware designs at runtime,” in <i>Reconfigurable Computing
    and FPGAs (ReConFig), 2013 International Conference on</i>, 2013, pp. 1–6.'
  mla: 'Anwer, Jahanzeb, et al. “Dynamic Reliability Management: Reconfiguring Reliability-Levels
    of Hardware Designs at Runtime.” <i>Reconfigurable Computing and FPGAs (ReConFig),
    2013 International Conference On</i>, 2013, pp. 1–6, doi:<a href="https://doi.org/10.1109/ReConFig.2013.6732280">10.1109/ReConFig.2013.6732280</a>.'
  short: 'J. Anwer, S. Meisner, M. Platzner, in: Reconfigurable Computing and FPGAs
    (ReConFig), 2013 International Conference On, 2013, pp. 1–6.'
date_created: 2019-07-10T09:32:57Z
date_updated: 2022-01-06T06:50:48Z
department:
- _id: '78'
doi: 10.1109/ReConFig.2013.6732280
keyword:
- fault tolerant computing
- field programmable gate arrays
- logic design
- reliability
- BYU-LANL tool
- DRM tool flow
- FPGA based hardware designs
- avionic application
- device technologies
- dynamic reliability management
- fault-tolerant operation
- hardware designs
- reconfiguring reliability levels
- space applications
- Field programmable gate arrays
- Hardware
- Redundancy
- Reliability engineering
- Runtime
- Tunneling magnetoresistance
language:
- iso: eng
page: 1-6
publication: Reconfigurable Computing and FPGAs (ReConFig), 2013 International Conference
  on
status: public
title: 'Dynamic reliability management: Reconfiguring reliability-levels of hardware
  designs at runtime'
type: conference
user_id: '3118'
year: '2013'
...
---
_id: '37056'
abstract:
- lang: eng
  text: In this paper we present an approach to increase the fault tolerance in FlexRay
    networks by introducing backup nodes to replace defect ECUs (Electronic Control
    Units). In order to reduce the memory requirements of such backup nodes, we distribute
    redundant tasks over different nodes and propose the distributed coordinated migration
    of tasks of the defect ECU to the backup node at runtime. This approach enhances
    our former work in, where we extended the FlexRay bus schedule by redundant slots
    to consider changes in the communication/slot assignment and investigated and
    evaluated different solutions to migrate the redundant tasks to the backup node
    using the static and/or dynamic segment of the communication cycle for transmissions.
    We present the approach of distributed coordination for migration and communication
    instead of additional dedicated coordinator nodes to further increase the fault
    tolerance. With this approach we improve the safety of FlexRay networks by avoiding
    a possible single point of failure due to a dedicated coordinator node also minimizing
    the necessary time needed for a reconfiguration after an ECU failure. Furthermore,
    we reduce the overhead within the communication and the demand for additional
    hardware components.
author:
- first_name: Kay
  full_name: Klobedanz, Kay
  last_name: Klobedanz
- first_name: Gilles B.
  full_name: Defo, Gilles B.
  last_name: Defo
- first_name: Wolfgang
  full_name: Müller, Wolfgang
  id: '16243'
  last_name: Müller
- first_name: Timo
  full_name: Kerstan, Timo
  last_name: Kerstan
citation:
  ama: 'Klobedanz K, Defo GB, Müller W, Kerstan T. Distributed Coordination of Task
    Migration for Fault-Tolerant FlexRay Networks. In: <i>Proceedings of SIES 2010</i>.
    ; 2010. doi:<a href="https://doi.org/10.1109/SIES.2010.5551384">10.1109/SIES.2010.5551384</a>'
  apa: Klobedanz, K., Defo, G. B., Müller, W., &#38; Kerstan, T. (2010). Distributed
    Coordination of Task Migration for Fault-Tolerant FlexRay Networks. <i>Proceedings
    of SIES 2010</i>. International Symposium on Industrial Embedded System (SIES).
    <a href="https://doi.org/10.1109/SIES.2010.5551384">https://doi.org/10.1109/SIES.2010.5551384</a>
  bibtex: '@inproceedings{Klobedanz_Defo_Müller_Kerstan_2010, place={Trento, Italien},
    title={Distributed Coordination of Task Migration for Fault-Tolerant FlexRay Networks},
    DOI={<a href="https://doi.org/10.1109/SIES.2010.5551384">10.1109/SIES.2010.5551384</a>},
    booktitle={Proceedings of SIES 2010}, author={Klobedanz, Kay and Defo, Gilles
    B. and Müller, Wolfgang and Kerstan, Timo}, year={2010} }'
  chicago: Klobedanz, Kay, Gilles B. Defo, Wolfgang Müller, and Timo Kerstan. “Distributed
    Coordination of Task Migration for Fault-Tolerant FlexRay Networks.” In <i>Proceedings
    of SIES 2010</i>. Trento, Italien, 2010. <a href="https://doi.org/10.1109/SIES.2010.5551384">https://doi.org/10.1109/SIES.2010.5551384</a>.
  ieee: 'K. Klobedanz, G. B. Defo, W. Müller, and T. Kerstan, “Distributed Coordination
    of Task Migration for Fault-Tolerant FlexRay Networks,” presented at the International
    Symposium on Industrial Embedded System (SIES), 2010, doi: <a href="https://doi.org/10.1109/SIES.2010.5551384">10.1109/SIES.2010.5551384</a>.'
  mla: Klobedanz, Kay, et al. “Distributed Coordination of Task Migration for Fault-Tolerant
    FlexRay Networks.” <i>Proceedings of SIES 2010</i>, 2010, doi:<a href="https://doi.org/10.1109/SIES.2010.5551384">10.1109/SIES.2010.5551384</a>.
  short: 'K. Klobedanz, G.B. Defo, W. Müller, T. Kerstan, in: Proceedings of SIES
    2010, Trento, Italien, 2010.'
conference:
  name: International Symposium on Industrial Embedded System (SIES)
date_created: 2023-01-17T11:31:38Z
date_updated: 2023-01-17T11:31:47Z
department:
- _id: '672'
doi: 10.1109/SIES.2010.5551384
keyword:
- Fault tolerant systems
- Protocols
- Redundancy
- Runtime
- Payloads
- Schedules
language:
- iso: eng
place: Trento, Italien
publication: Proceedings of SIES 2010
publication_identifier:
  eisbn:
  - 978-1-4244-5841-7
status: public
title: Distributed Coordination of Task Migration for Fault-Tolerant FlexRay Networks
type: conference
user_id: '5786'
year: '2010'
...
---
_id: '10646'
author:
- first_name: Klaus
  full_name: Danne, Klaus
  last_name: Danne
- first_name: Roland
  full_name: Mühlenbernd, Roland
  last_name: Mühlenbernd
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: Danne K, Mühlenbernd R, Platzner M. Server-based execution of periodic tasks
    on dynamically reconfigurable hardware. <i>IET Computers Digital Techniques</i>.
    2007;1(4):295-302. doi:<a href="https://doi.org/10.1049/iet-cdt:20060186">10.1049/iet-cdt:20060186</a>
  apa: Danne, K., Mühlenbernd, R., &#38; Platzner, M. (2007). Server-based execution
    of periodic tasks on dynamically reconfigurable hardware. <i>IET Computers Digital
    Techniques</i>, <i>1</i>(4), 295–302. <a href="https://doi.org/10.1049/iet-cdt:20060186">https://doi.org/10.1049/iet-cdt:20060186</a>
  bibtex: '@article{Danne_Mühlenbernd_Platzner_2007, title={Server-based execution
    of periodic tasks on dynamically reconfigurable hardware}, volume={1}, DOI={<a
    href="https://doi.org/10.1049/iet-cdt:20060186">10.1049/iet-cdt:20060186</a>},
    number={4}, journal={IET Computers Digital Techniques}, author={Danne, Klaus and
    Mühlenbernd, Roland and Platzner, Marco}, year={2007}, pages={295–302} }'
  chicago: 'Danne, Klaus, Roland Mühlenbernd, and Marco Platzner. “Server-Based Execution
    of Periodic Tasks on Dynamically Reconfigurable Hardware.” <i>IET Computers Digital
    Techniques</i> 1, no. 4 (2007): 295–302. <a href="https://doi.org/10.1049/iet-cdt:20060186">https://doi.org/10.1049/iet-cdt:20060186</a>.'
  ieee: K. Danne, R. Mühlenbernd, and M. Platzner, “Server-based execution of periodic
    tasks on dynamically reconfigurable hardware,” <i>IET Computers Digital Techniques</i>,
    vol. 1, no. 4, pp. 295–302, 2007.
  mla: Danne, Klaus, et al. “Server-Based Execution of Periodic Tasks on Dynamically
    Reconfigurable Hardware.” <i>IET Computers Digital Techniques</i>, vol. 1, no.
    4, 2007, pp. 295–302, doi:<a href="https://doi.org/10.1049/iet-cdt:20060186">10.1049/iet-cdt:20060186</a>.
  short: K. Danne, R. Mühlenbernd, M. Platzner, IET Computers Digital Techniques 1
    (2007) 295–302.
date_created: 2019-07-10T11:10:54Z
date_updated: 2022-01-06T06:50:49Z
department:
- _id: '78'
doi: 10.1049/iet-cdt:20060186
intvolume: '         1'
issue: '4'
keyword:
- reconfigurable architectures
- resource allocation
- device reconfiguration time
- dynamic hardware reconfiguration
- dynamically reconfigurable hardware
- light-weight runtime system
- merge server distribute load
- periodic real-time tasks
- runtime system overheads
- schedulability analysis
- scheduling technique
- server-based execution
- synthesis tool flow
language:
- iso: eng
page: 295-302
publication: IET Computers Digital Techniques
publication_identifier:
  issn:
  - 1751-8601
status: public
title: Server-based execution of periodic tasks on dynamically reconfigurable hardware
type: journal_article
user_id: '3118'
volume: 1
year: '2007'
...
---
_id: '39032'
abstract:
- lang: eng
  text: Executable UML models are nowadays gaining interest in embedded systems design.
    This domain is strongly devoted to the modeling of reactive behavior using StateChart
    variants. In this context, the direct execution of UML state machines is an interesting
    alternative to native code generation approaches since it significantly increases
    portability. However, fully featured UML 2.0 State Machines may contain a broad
    set of features with complex execution semantics that differ significantly from
    other StateChart variants. This makes their direct execution complex and inefficient.
    In this paper, we demonstrate how such state machines can be represented using
    a small subset of the UML state machine features that enables efficient execution.
    We describe the necessary model transformations in terms of graph transformations
    and discuss the underlying semantics and implications for execution.
author:
- first_name: Tim
  full_name: Schattkowsky, Tim
  last_name: Schattkowsky
- first_name: Wolfgang
  full_name: Müller, Wolfgang
  id: '16243'
  last_name: Müller
citation:
  ama: 'Schattkowsky T, Müller W. Transformation of UML State Machines for Direct
    Execution. In: <i>Proceedings of VL/HCC 05</i>. ; 2005. doi:<a href="https://doi.org/10.1109/VLHCC.2005.64">10.1109/VLHCC.2005.64</a>'
  apa: Schattkowsky, T., &#38; Müller, W. (2005). Transformation of UML State Machines
    for Direct Execution. <i>Proceedings of VL/HCC 05</i>. <a href="https://doi.org/10.1109/VLHCC.2005.64">https://doi.org/10.1109/VLHCC.2005.64</a>
  bibtex: '@inproceedings{Schattkowsky_Müller_2005, place={Dallas, TX, USA}, title={Transformation
    of UML State Machines for Direct Execution}, DOI={<a href="https://doi.org/10.1109/VLHCC.2005.64">10.1109/VLHCC.2005.64</a>},
    booktitle={Proceedings of VL/HCC 05}, author={Schattkowsky, Tim and Müller, Wolfgang},
    year={2005} }'
  chicago: Schattkowsky, Tim, and Wolfgang Müller. “Transformation of UML State Machines
    for Direct Execution.” In <i>Proceedings of VL/HCC 05</i>. Dallas, TX, USA, 2005.
    <a href="https://doi.org/10.1109/VLHCC.2005.64">https://doi.org/10.1109/VLHCC.2005.64</a>.
  ieee: 'T. Schattkowsky and W. Müller, “Transformation of UML State Machines for
    Direct Execution,” 2005, doi: <a href="https://doi.org/10.1109/VLHCC.2005.64">10.1109/VLHCC.2005.64</a>.'
  mla: Schattkowsky, Tim, and Wolfgang Müller. “Transformation of UML State Machines
    for Direct Execution.” <i>Proceedings of VL/HCC 05</i>, 2005, doi:<a href="https://doi.org/10.1109/VLHCC.2005.64">10.1109/VLHCC.2005.64</a>.
  short: 'T. Schattkowsky, W. Müller, in: Proceedings of VL/HCC 05, Dallas, TX, USA,
    2005.'
date_created: 2023-01-24T08:18:10Z
date_updated: 2023-01-24T08:18:27Z
department:
- _id: '672'
doi: 10.1109/VLHCC.2005.64
keyword:
- Unified modeling language
- Software design
- Virtual machining
- Embedded system
- Programming
- Documentation
- Hardware
- Computer languages
- Operating systems
- Runtime
language:
- iso: eng
place: Dallas, TX, USA
publication: Proceedings of VL/HCC 05
publication_identifier:
  isbn:
  - 0-7695-2443-5
status: public
title: Transformation of UML State Machines for Direct Execution
type: conference
user_id: '5786'
year: '2005'
...
---
_id: '39521'
abstract:
- lang: eng
  text: Investigates the integration of an interactive constraint solver into an existing
    2D real-time animation environment in order to achieve a better observability,
    traceability and stability of the individual graphical objects. We present two
    approaches for assigning constraints to the objects. The first approach assigns
    constraints to the objects when they are created, keeping them stable during their
    entire life-time. The second approach dynamically changes constraints before the
    computation of each frame. The investigation is based on our practical experience
    with the complete visual programming language Pictorial Janus and the parallel
    constraint solver Parcon.
author:
- first_name: P.
  full_name: Griebel, P.
  last_name: Griebel
- first_name: Georg
  full_name: Lehrenfeld, Georg
  last_name: Lehrenfeld
- first_name: Wolfgang
  full_name: Müller, Wolfgang
  id: '16243'
  last_name: Müller
- first_name: C.
  full_name: Tahedl, C.
  last_name: Tahedl
- first_name: H.
  full_name: Uhr, H.
  last_name: Uhr
citation:
  ama: 'Griebel P, Lehrenfeld G, Müller W, Tahedl C, Uhr H. Integrating a Constraint
    Solver into a Real-Time Animation Environment. In: <i>Proceedings of the 1996
    IEEE Symposium on Visual Languages</i>. ; 1996. doi:<a href="https://doi.org/10.1109/VL.1996.545262">10.1109/VL.1996.545262</a>'
  apa: Griebel, P., Lehrenfeld, G., Müller, W., Tahedl, C., &#38; Uhr, H. (1996).
    Integrating a Constraint Solver into a Real-Time Animation Environment. <i>Proceedings
    of the 1996 IEEE Symposium on Visual Languages</i>. <a href="https://doi.org/10.1109/VL.1996.545262">https://doi.org/10.1109/VL.1996.545262</a>
  bibtex: '@inproceedings{Griebel_Lehrenfeld_Müller_Tahedl_Uhr_1996, place={Boulder
    CO}, title={Integrating a Constraint Solver into a Real-Time Animation Environment},
    DOI={<a href="https://doi.org/10.1109/VL.1996.545262">10.1109/VL.1996.545262</a>},
    booktitle={Proceedings of the 1996 IEEE Symposium on Visual Languages}, author={Griebel,
    P. and Lehrenfeld, Georg and Müller, Wolfgang and Tahedl, C. and Uhr, H.}, year={1996}
    }'
  chicago: Griebel, P., Georg Lehrenfeld, Wolfgang Müller, C. Tahedl, and H. Uhr.
    “Integrating a Constraint Solver into a Real-Time Animation Environment.” In <i>Proceedings
    of the 1996 IEEE Symposium on Visual Languages</i>. Boulder CO, 1996. <a href="https://doi.org/10.1109/VL.1996.545262">https://doi.org/10.1109/VL.1996.545262</a>.
  ieee: 'P. Griebel, G. Lehrenfeld, W. Müller, C. Tahedl, and H. Uhr, “Integrating
    a Constraint Solver into a Real-Time Animation Environment,” 1996, doi: <a href="https://doi.org/10.1109/VL.1996.545262">10.1109/VL.1996.545262</a>.'
  mla: Griebel, P., et al. “Integrating a Constraint Solver into a Real-Time Animation
    Environment.” <i>Proceedings of the 1996 IEEE Symposium on Visual Languages</i>,
    1996, doi:<a href="https://doi.org/10.1109/VL.1996.545262">10.1109/VL.1996.545262</a>.
  short: 'P. Griebel, G. Lehrenfeld, W. Müller, C. Tahedl, H. Uhr, in: Proceedings
    of the 1996 IEEE Symposium on Visual Languages, Boulder CO, 1996.'
date_created: 2023-01-24T11:56:25Z
date_updated: 2023-01-24T11:56:30Z
department:
- _id: '672'
doi: 10.1109/VL.1996.545262
keyword:
- Animation
- Layout
- Computer languages
- Visualization
- Observability
- Stability
- Runtime
- Costs
- Graphics
- Hardware
language:
- iso: eng
place: Boulder CO
publication: Proceedings of the 1996 IEEE Symposium on Visual Languages
publication_identifier:
  isbn:
  - 0-8186-7508-X
status: public
title: Integrating a Constraint Solver into a Real-Time Animation Environment
type: conference
user_id: '5786'
year: '1996'
...