Sciweavers

3320 search results - page 40 / 664
» Heuristics for the Phylogeny Problem
Sort
View
WEA
2004
Springer
129views Algorithms» more  WEA 2004»
14 years 3 months ago
Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
Geiza C. Silva, Luiz Satoru Ochi, Simone L. Martin...
EOR
2010
104views more  EOR 2010»
13 years 7 months ago
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
Fatih Safa Erenay, Ihsan Sabuncuoglu, Aysegül...
HEURISTICS
1998
252views more  HEURISTICS 1998»
13 years 9 months ago
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem
In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by man...
P. C. Chu, J. E. Beasley
EOR
2007
158views more  EOR 2007»
13 years 10 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...
BMCBI
2006
75views more  BMCBI 2006»
13 years 10 months ago
Improving the specificity of high-throughput ortholog prediction
Background: Orthologs (genes that have diverged after a speciation event) tend to have similar function, and so their prediction has become an important component of comparative g...
Debra L. Fulton, Yvonne Y. Li, Matthew R. Laird, B...