14518 search results - page 216 / 2904 » Two Problems for Sophistication |
78
Voted
WABI
2005
Springer
15 years 6 months ago
2005
Springer
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
103
click to vote
EVOW
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is tackl...
105
click to vote
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
A novel approach to classification is proposed in which a Paretobased ranking of individuals is used to encourage multiple individuals to participate in the solution. To do so, th...
121
Voted
CATA
2004
15 years 2 months ago
2004
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...