In early 2008 a new testing branch of the network analysis software visone has been made publicly available [Baur et al., 2008]. This realease includes the ability to process dynamic networks. A central feature is a dedicated dynamic layout algorithm which we present here from a methological and application oriented point of view. We first describe this algorithm from an algorithmic perspective...

In this paper, a number of symmetry-breaking (SB) constraints are considered to improve the performance and decrease computational effort needed in the solution of Process Plant Layout (PPL) Problems. The PPL problems are formulated as mixed-integer linear (MILP) models. In order to determine the efficiency of the symmetry-breaking formulations, test runs are carried out on three different prob...

Consider the problem of automatically generating layouts for state diagrams (statecharts). Such diagrams appear in automation engeneering and CASE tools. Automatic layout of these diagrams leads to better understanding and saves time spend on their development. State diagram layout problem seems to have some differences from general graph layout problem. In this article adaptation of two graph ...

As the ever-increasing gap between the speed of processor and the speed of memory has become the cause of one of primary bottlenecks of computer systems, modern architecture systems use cache to solve this problem, whose utility heavily depends on program data locality. This paper introduces a platform independent data-layout optimization framework to improve program data locality. This framewo...