Sciweavers

1593 search results - page 5 / 319
» The Complexity of Computing the Size of an Interval
Sort
View
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 9 days ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
13 years 11 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
JDCTA
2010
228views more  JDCTA 2010»
13 years 2 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
CORR
2007
Springer
94views Education» more  CORR 2007»
13 years 7 months ago
Size reduction of complex networks preserving modularity
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
Alex Arenas, J. Duch, A. Fernandez, Sergio G&oacut...
BCB
2010
161views Bioinformatics» more  BCB 2010»
13 years 2 months ago
Genome-wide compatible SNP intervals and their properties
Recent studies suggest that the mammalian genomes can be subdivided in segments within which there is limited haplotype diversity. Understanding the distribution and structure of ...
Jeremy W. Wang, Kyle J. Moore, Qi Zhang, Fernando ...