The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Abstract. Two highly visible public communication networks are the publicswitched telephone network (PSTN) and the Internet. While they typically provide different services and the...
The paper presents a method to compute performance metrics (response time, sojourn time, throughput) on Unified Modeling Language design. The method starts with UML design annota...
We study the evolution of robustness in digital organisms adapting to a high mutation rate. As genomes adjust to the harsh mutational environment, the mean effect of single mutatio...
This paper explores the use of genetic algorithms for the design of networks, where the demands on the network fluctuate in time. For varying network constraints, we find the best...