Sciweavers

768 search results - page 85 / 154
» Asymptotic Cellular Complexity
Sort
View
IJDMB
2010
61views more  IJDMB 2010»
13 years 7 months ago
On a novel coalescent model for genome-wide evolution of Copy Number Variations
: Since we are limited in our knowledge of human demographic history and variations of recombination and mutation rates, large-scale computer simulation is a necessary tool in gene...
Antonina Mitrofanova, Bhubaneswar (Bud) Mishra
SSPR
2010
Springer
13 years 7 months ago
Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
Samuel Rota Bulò, Immanuel M. Bomze, Marcel...
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
13 years 6 months ago
Improved analysis methods for crossover-based algorithms
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Benjamin Doerr, Madeleine Theile
DAM
2011
13 years 4 months ago
Noisy colored point set matching
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
Yago Diez, Joan Antoni Sellarès
CASC
2011
Springer
262views Mathematics» more  CASC 2011»
12 years 9 months ago
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
William Hart, Andrew Novocin