1522 search results - page 11 / 305 » On the Complexity of Several Haplotyping Problems |
119
click to vote
SODA
2012
ACM
13 years 1 days ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
DAGSTUHL
2006
14 years 11 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
105
click to vote
EC
2008
14 years 9 months ago
2008
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
CSL
2004
Springer
15 years 3 months ago
2004
Springer
By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formul...