472 search results - page 84 / 95 » Design of Iterated Local Search Algorithms |
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The most popular approaches for reconstructing phylogenetic trees attempt to solve NP-hard optimization criteria such as maximum parsimony (MP). Currently, the bestperforming heur...
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ) and (1 + 2) Evolution-Strategies (ESs) with the aim of designing f...
BMCBI
2007
14 years 9 months ago
2007
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
86
Voted
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...