77 search results - page 4 / 16 » Optimizing low-discrepancy sequences with an evolutionary al... |
103
Voted
CCECE
2006
IEEE
15 years 6 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
116
Voted
EUROGP
2009
Springer
14 years 10 months ago
2009
Springer
We have created a real-time evolutionary object recognition system. Genetic Programming is used to automatically search the space of possible computer vision programs guided throug...
113
click to vote
PLDI
2004
ACM
15 years 6 months ago
2004
ACM
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
141
Voted
EVOW
2010
Springer
14 years 11 months ago
2010
Springer
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Finding binary sequences with low autocorrelation is a very hard problem with many practical applications. In this paper we analyze several metaheuristic approaches to tackle the ...