Sciweavers

27692 search results - page 71 / 5539
» Where is ...
Sort
View
JDA
2007
73views more  JDA 2007»
13 years 8 months ago
Parameterized matching with mismatches
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...
Alberto Apostolico, Péter L. Erdös, Mo...
JNSM
2007
109views more  JNSM 2007»
13 years 8 months ago
Routing Management in the PSTN and the Internet: A Historical Perspective
Abstract. Two highly visible public communication networks are the publicswitched telephone network (PSTN) and the Internet. While they typically provide different services and the...
Deep Medhi
JSS
2007
86views more  JSS 2007»
13 years 8 months ago
Performance evaluation of UML design with Stochastic Well-formed Nets
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...
Simona Bernardi, José Merseguer
ALIFE
2004
13 years 8 months ago
Evolution of Robustness in Digital Organisms
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...
Jeffrey A. Edlund, Christoph Adami
CORR
2004
Springer
81views Education» more  CORR 2004»
13 years 8 months ago
Optimizing genetic algorithm strategies for evolving networks
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...
Matthew J. Berryman, Andrew Allison, Derek Abbott