Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
—In this paper, we present a new spectrum-hole prediction model for cognitive radio (CR) systems based on the IEEE 802.11 wireless local areas networks. We have also analyzed the...
We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1, . . . , m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the funct...
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...
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, ...