Abstract: This work addresses an energy-minimized deadline-constrained task scheduling problem in human-cyber-physical systems. It consists of three subproblems: processor allocation, task sequencing, ...
Abstract: The pathfinding problem in a graph has been solved using several classical algorithms, notably Dijkstra’s and A* algorithms. However, most classical algorithms are most effective on static ...
Within the STRUCTURES Cluster of Excellence, two research teams at the Interdisciplinary Center for Scientific Computing (IWR) have refined a computing process, long held to be unreliable, such that ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results