—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
The contribution presents a heuristic for the three-dimensional strip packing problem (3D-SPP) with rectangular pieces (boxes). The considered 3D-SPP can be formulated as follows:...
Distributed applications must often consider and select the appropriate trade-offs among three important aspects ? fault-tolerance, performance and resources. We introduce a novel ...
Abstract. Development of composed services requires a continues adaptation of the composed service to the changing environment of offered services. Services may no longer be avail...
The Program Dependence Graph was introduced by Ottenstein and Ottenstein in 1984. It was suggested to be a suitable internal program representation for monolithic programs, for th...