We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
The FermaT transformation system, based on research carried out over the last sixteen years at Durham University, De Montfort University and Software Migrations Ltd., is an indust...
A software reconfiguration pattern is a solution to a problem in component-based software systems where the configuration needs to be updated while the system is operational. It d...
We are located in the context of the simulation of complex industrial systems, which are distributed in geographical, decisional and informational terms. This paper is divided int...
Statistical exploratory data analysis (EDA) poses a di cult search problem. However, the EDA process lends itself to a planning formulation. We have built a system, called Aide, t...