@misc{25126,
  abstract     = {{Motivated by the prospect of computing agents that explore unknown environments and construct convex hulls on the nanoscale, we investigate the capabilities and limitations of a single deterministic finite automaton robot in the three-dimensional hybrid model for programmable matter. In this model, active robots move on a set of passive tiles, called configuration, with the geometric shape of rhombic dodecahedra on the adjacency graph of the face-centered cubic sphere-packing. We show that the exploration problem is equally hard in the hybrid model and in three-dimensional mazes, in which tiles have the shape of cubes and are positioned at the vertices of $\mathbb{Z}^3$. Thereby, a single robot with a constant number of pebbles cannot solve this problem in the hybrid model on arbitrary configurations. We provide algorithms for a robot with two pebbles that solve the exploration problem in the subclass of compact configurations of size $n$ in $\O(n^3)$ rounds. Further, we investigate the robot's capabilities of detection and hull construction in terms of restricted orientation convexity. We show that a robot without any pebble can detect strong $\O$-convexity in $\O(n)$ rounds, but cannot detect weak $\O$-convexity, not even if provided with a single pebble. Assuming that a robot can construct tiles from scratch and deconstruct previously constructed tiles, we show that the strong $\O$-hull of any given configuration of size $n$ can be constructed in $\O(n^4)$ rounds, even if the robot cannot distinguish constructed from native tiles.}},
  author       = {{Liedtke, David Jan}},
  keywords     = {{Robot Exploration, Finite Automaton, Hybrid Model for Programmable Matter, Convex Hull}},
  title        = {{{Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model}}},
  year         = {{2021}},
}

@inproceedings{22309,
  abstract     = {{Approximate computing (AC) has acquired significant maturity in recent years as a promising approach to obtain energy and area-efficient hardware. Automated approximate accelerator synthesis involves a great deal of complexity on the size of design space which exponentially grows with the number of possible approximations. Design space exploration of approximate accelerator synthesis is usually targeted via heuristic-based search methods. The majority of existing frameworks prune a large part of the design space using a greedy-based approach to keep the problem tractable. Therefore, they result in inferior solutions since many potential solutions are neglected in the pruning process without the possibility of backtracking of removed approximate instances. In this paper, we address the aforementioned issue by adopting Monte Carlo Tree Search (MCTS), as an efficient stochastic learning-based search algorithm, in the context of automated synthesis of approximate accelerators. This enables the synthesis frameworks to deeply subsamples the design space of approximate accelerator synthesis toward most promising approximate instances based on the required performance goals, i.e., power consumption, area, or/and delay. We investigated the challenges of providing an efficient open-source framework that benefits analytical and search-based approximation techniques simultaneously to both speed up the synthesis runtime and improve the quality of obtained results. Besides, we studied the utilization of machine learning algorithms to improve the performance of several critical steps, i.e., accelerator quality testing, in the synthesis framework. The proposed framework can help the community to rapidly generate efficient approximate accelerators in a reasonable runtime.}},
  author       = {{Awais, Muhammad and Platzner, Marco}},
  booktitle    = {{Proceedings of IEEE Computer Society Annual Symposium on VLSI}},
  keywords     = {{Approximate computing, Design space exploration, Accelerator synthesis}},
  location     = {{Tampa, Florida USA (Virtual)}},
  pages        = {{384--389}},
  publisher    = {{IEEE}},
  title        = {{{MCTS-Based Synthesis Towards Efficient Approximate Accelerators}}},
  year         = {{2021}},
}

@inproceedings{9708,
  abstract     = {{Increased interconnectedness of multiple actors and digital resources in service eco-systems offer new opportunities for service innovation. In digitally transforming eco-systems, organizations need to explore and exploit innovation simultaneously, which is defined as ambidexterity. However, research on ambidextrous service innovation is scarce. We provide a systematic literature review based on the concepts of ambidexterity, offering two contributions. First, research strands are disconnected, emphasizing either exploration or exploitation of service innovation, despite an organizations’ need to accelerate innovation cycles of exploring and exploiting services. Second, a new framework for ambidextrous service innovation is provided, inspired by the dynamism and generative mechanisms of the ontologically related concept of organizational routines. The framework adopts the perspective of a mutually constitutive relationship between exploring new and exploiting current resources, activities, and knowledge. The findings remedy the scattered literature through a coherent perspective on service innovation that responds to organizations’ needs and guides future research.}},
  author       = {{Wolf, Verena}},
  booktitle    = {{Proceedings of the 14th International Conference on Wirtschaftsinformatik}},
  keywords     = {{Exploration, Exploitation, Service Innovation, Organizational Routines, Ambidexterity}},
  location     = {{Siegen, Germany}},
  title        = {{{Ambidexterity in Service Innovation Research: A Systematic Literature Review}}},
  year         = {{2019}},
}

@unpublished{16853,
  abstract     = {{State-of-the-art frameworks for generating approximate circuits usually rely on information gained through circuit synthesis and/or verification to explore the search space and to find an optimal solution. Throughout the process, a large number of circuits may be subject to processing, leading to considerable runtimes. In this work, we propose a search which takes error bounds and pre-computed impact factors into account to reduce the number of invoked synthesis and verification processes. In our experimental results, we achieved speed-ups of up to 76x while area savings remain comparable to the reference search method, simulated annealing.}},
  author       = {{Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco}},
  booktitle    = {{Fourth Workshop on Approximate Computing (AxC 2019)}},
  keywords     = {{Approximate computing, parameter selection, search space exploration, verification, circuit synthesis}},
  pages        = {{2}},
  title        = {{{Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}}},
  year         = {{2019}},
}

@inproceedings{2200,
  author       = {{Kenter, Tobias and Platzner, Marco and Plessl, Christian and Kauschke, Michael}},
  booktitle    = {{Proc. Int. Symp. on Field-Programmable Gate Arrays (FPGA)}},
  isbn         = {{978-1-4503-0554-9}},
  keywords     = {{design space exploration, LLVM, partitioning, performance, estimation, funding-intel}},
  pages        = {{177--180}},
  publisher    = {{ACM}},
  title        = {{{Performance Estimation Framework for Automated Exploration of CPU-Accelerator Architectures}}},
  doi          = {{10.1145/1950413.1950448}},
  year         = {{2011}},
}

@inproceedings{37007,
  abstract     = {{UML is widely applied for the specification and modeling of software and some studies have demonstrated that it is applicable for HW/SW codesign. However, in this area there is still a big gap from UML modeling to SystemC-based verification and synthesis environments. This paper presents an efficient approach to bridge this gap in the context of Systems-on-a-Chip (SoC) design. We propose a framework for the seamless integration of a customized SysML entry with code generation for HW/SW cosimulation and high-level FPGA synthesis. For this, we extended the SysML UML profile by SystemC and synthesis capabilities. Two case studies demonstrate the applicability of our approach.}},
  author       = {{Mischkalla, Fabian and He, Da and Müller, Wolfgang}},
  booktitle    = {{Proceedings of DATE’10}},
  keywords     = {{Unified modeling language, Field programmable gate arrays, Bridges, Helium, Real time systems, Operating systems, Documentation, Application software, XML, Space exploration}},
  location     = {{Dresden}},
  publisher    = {{IEEE}},
  title        = {{{Closing the Gap between UML-based Modeling and Simulation of Combined HW/SW Systems}}},
  doi          = {{10.1109/DATE.2010.5456990}},
  year         = {{2010}},
}