Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann
Wireless sensor networks typically conserve energy by following a periodic wakeup-sleep schedule: nodes minimize idle time and spend most of their time in a low power sleep state. ...
Unlike traditional classification tasks, multilabel classification allows a sample to associate with more than one label. This generalization naturally arises the difficulty in cla...
Abstract--We investigate an abstraction method, called meanfield method, for the performance evaluation of dynamic networks with pairwise communication between nodes. It allows us ...