TY  - JOUR
A1  - Wahl, Marina
A1  - Hölscher, Michael
T1  - Und am Wochenende Blended Learning
BT  - Herausforderungen und Maßnahmen für Lehr-Lern-Szenarien in der universitären Weiterbildung. Das Beispiel Universität Speyer.
JF  - E-Learning Symposium 2018
N2  - 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.
KW  - Blended Learning
KW  - E-Learning
KW  - Weiterbildung
KW  - LMS
KW  - OpenOLAT
KW  - Strategie
Y1  - 2018
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-421910
SP  - 17
EP  - 27
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - GEN
A1  - Neubauer, Kai
A1  - Haubelt, Christian
A1  - Wanko, Philipp
A1  - Schaub, Torsten
T1  - Utilizing quad-trees for efficient design space exploration with partial assignment evaluation
T2  - 2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)
N2  - 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.
Y1  - 2018
SN  - 978-1-5090-0602-1
U6  - https://doi.org/10.1109/ASPDAC.2018.8297362
SN  - 2153-6961
SP  - 434
EP  - 439
PB  - IEEE
CY  - New York
ER  -