11740 search results - page 128 / 2348 » More Problems in Rewriting |
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...
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...
112
Voted
STOC
2003
ACM
16 years 1 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
93
Voted
EVOW
2009
Springer
15 years 7 months ago
2009
Springer
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
103
Voted
HICSS
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...