Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Abstract—Today, software product line engineering concentrates on tailoring the functionality of programs. However, we and others observed an increasing interest in non-functiona...
Norbert Siegmund, Martin Kuhlemann, Mario Pukall, ...
We consider a wireless multi-hop network with sources that are Poisson distributed and relays which are placed on the source-destination line. Given a combined TDMA/ALOHA MAC proto...
In the realm of multilabel classification (MLC), it has become an opinio communis that optimal predictive performance can only be achieved by learners that explicitly take label d...
Abstract-- The efficiency of distributed sensor networks depends on an optimal trade-off between the usage of resources and data quality. The work in this paper addresses the probl...
Amanda Prorok, Christopher M. Cianci, Alcherio Mar...