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...
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Combining classifier methods have shown their effectiveness in a number of applications. Nonetheless, using simultaneously multiple classifiers may result in some cases in a reduc...
Claudio De Stefano, Francesco Fontanella, Alessand...
The dynamic nature of Service-Oriented Architectures challenges traditional systems management practices which tend to be static in nature. We propose a goal-oriented, agent-based...
Patrick Martin, Wendy Powley, Imad Abdallah, Jun L...
With the increasing deployment and use of GPS-enabled devices, massive amounts of GPS data are becoming available. We propose a general framework for the mining of semantically me...