: At present a large amount of research exists into the design and implementation of adaptive systems. However, not many target the complex task of authoring in such systems, or th...
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
David Starobinski, Mark G. Karpovsky, Lev Zakrevsk...
Manufacturing companies that are expanding their product offering to cover also lifecycle services in the customers’ facilities are facing the increasing complexity and risk to ...
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...