For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
Stephan Brandt, Jozef Miskuf, Dieter Rautenbach, F...
Software development and testing of Enterprise Resource Planning (ERP) systems demands dedicated methods to tackle its special features. As manual testing is not able to systematic...
Abstract--This paper considers the novel area of quality-ofinformation (QoI)-aware network management of multitasking wireless sensor networks (WSNs). Specifically, it provides an ...
Chi Harold Liu, Chatschik Bisdikian, Joel W. Branc...
Theoretical models of ultrawideband (UWB) radio channels indicate that pairs of UWB radio transceivers measure their common radio channel with a high degree of agreement and third ...
Masoud Ghoreishi Madiseh, Shuai He, Michael L. McG...
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...