Institut für Informatik und Computational Science
Refine
Year of publication
- 2018 (42) (remove)
Document Type
- Article (21)
- Other (13)
- Doctoral Thesis (3)
- Part of a Book (2)
- Conference Proceeding (2)
- Postprint (1)
Keywords
- E-Learning (3)
- TPACK (2)
- argument mining (2)
- parsing (2)
- physical computing (2)
- 2-tag system (1)
- ARCS Modell (1)
- ASP (Answer Set Programming) (1)
- Adaptivität (1)
- Answer set programming (1)
Institute
Berufsbegleitende Studiengänge stehen vor besonderen Schwierigkeiten, für die der Einsatz von Blended Learning-Szenarien sinnvoll sein kann. Welche speziellen Herausforderungen sich dabei ergeben und welche Lösungsansätze dagegen steuern, betrachtet der folgende Artikel anhand eines Praxisberichts aus dem Studiengang M. P. A. Wissenschaftsmanagement an der Universität Speyer.
Utilizing quad-trees for efficient design space exploration with partial assignment evaluation
(2018)
Recently, it has been shown that constraint-based symbolic solving techniques offer an efficient way for deciding binding and routing options in order to obtain a feasible system level implementation. In combination with various background theories, a feasibility analysis of the resulting system may already be performed on partial solutions. That is, infeasible subsets of mapping and routing options can be pruned early in the decision process, which fastens the solving accordingly. However, allowing a proper design space exploration including multi-objective optimization also requires an efficient structure for storing and managing non-dominated solutions. In this work, we propose and study the usage of the Quad-Tree data structure in the context of partial assignment evaluation during system synthesis. Out experiments show that unnecessary dominance checks can be avoided, which indicates a preference of Quad-Trees over a commonly used list-based implementation for large combinatorial optimization problems.