Mobile agents, i.e. pieces of programs that can be sent around networks of computers, appear more and more frequently on the Internet. These programs...
For a connected, undirected and weighted graph G = (V, E), the problem of finding the k most vital edges of G with respect to minimum spanning tree is...
A stabilizing algorithm is silent if starting from an arbitrary state it converges to a global state after which the values stored in the communicatio...
This note deals with the scheduling problem of minimizing the sum of job completion times in a system with n jobs and a single machine. We investigate...
We introduce a formalism which allows to treat computer architecture as a formal optimization problem. We apply this to the design of shared memory pa...
