We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
Abstract. The performance of HPF codes is in uenced by the characteristics of the parallel system and by the e ciency of the compilation system. Performance analysis has to take in...
Maria Calzarossa, Luisa Massari, Alessandro P. Mer...
. A simple mechanism is presented, based on ant-like agents, for routing and load balancing in telecommunications networks, following the initial works of Appleby and Stewart [1] a...
Many computer simulations, experimental testing and monitoring of physical systems produce vast amounts of quantitative data. These data have always been assimilated by trained an...
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...