Sciweavers

928 search results - page 158 / 186
» The degree structure of Weihrauch-reducibility
Sort
View
PODC
2004
ACM
14 years 3 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
EUROGP
1999
Springer
14 years 2 months ago
Genetic Programming as a Darwinian Invention Machine
Genetic programming is known to be capable of creating designs that satisfy prespecified high-level design requirements for analog electrical circuits and other complex structures...
John R. Koza, Forrest H. Bennett III, Oscar Stiffe...
ICNP
1996
IEEE
14 years 2 months ago
On the relationship between file sizes, transport protocols, and self-similar network traffic
Recent measurements of local-area and wide-area traffic have shown that network traffic exhibits variability at a wide range of scales. In this paper, we examine a mechanism that ...
Kihong Park, Gitae Kim, Mark Crovella
ACMSE
2007
ACM
14 years 2 months ago
Verifying design modularity, hierarchy, and interaction locality using data clustering techniques
Modularity, hierarchy, and interaction locality are general approaches to reducing the complexity of any large system. A widely used principle in achieving these goals in designin...
Liguo Yu, Srini Ramaswamy
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
14 years 3 days ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti