Sciweavers

890 search results - page 66 / 178
» New Approaches to Compare Phylogenetic Search Heuristics
Sort
View
CP
2003
Springer
15 years 11 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
GECCO
2010
Springer
176views Optimization» more  GECCO 2010»
15 years 8 months ago
A hierarchical cooperative evolutionary algorithm
To successfully search multiple coadaptive subcomponents in a solution, we developed a novel cooperative evolutionary algorithm based on a new computational multilevel selection f...
Shelly Xiaonan Wu, Wolfgang Banzhaf
ENDM
2008
93views more  ENDM 2008»
15 years 6 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
AMC
2008
206views more  AMC 2008»
15 years 4 months ago
Global-best harmony search
ct 8 Harmony search (HS) is a new meta-heuristic optimization method imitating the music improvisation process where 9 musicians improvise their instruments' pitches searching...
Mahamed G. H. Omran, Mehrdad Mahdavi
SCHEDULING
2008
112views more  SCHEDULING 2008»
15 years 5 months ago
Time-constrained project scheduling
We propose a new approach for scheduling with strict deadlines and apply this approach to the TimeConstrained Project Scheduling Problem (TCPSP). To be able to meet these deadlines...
T. A. Guldemond, Johann Hurink, Jacob Jan Paulus, ...