3320 search results - page 145 / 664 » Heuristics for the Phylogeny Problem |
145
click to vote
EVOW
2003
Springer
15 years 11 months ago
2003
Springer
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NP-hard and known in the literature as...
148
click to vote
FLAIRS
2006
15 years 8 months ago
2006
The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was propos...
160
click to vote
COR
2010
15 years 6 months ago
2010
The Max-Min Diversity Problem (MMDP) consists in selecting a subset of elements from a given set in such a way that the diversity among the selected elements is maximized. The prob...
153
click to vote
ENDM
2010
15 years 6 months ago
2010
We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...
163
click to vote
PPSN
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...