3320 search results - page 164 / 664 » Heuristics for the Phylogeny Problem |
147
click to vote
EVOW
2005
Springer
16 years 3 days ago
2005
Springer
We describe how the standard genotype-phenotype mapping process of Grammatical Evolution (GE) can be enhanced with an attribute grammar to allow GE to operate as a decoder-based Ev...
171
click to vote
AUSAI
2004
Springer
16 years 1 hour ago
2004
Springer
In this paper, we propose a new neighborhood structure based on the improvement graph for solving the Robust Graph Coloring Problem, an interesting extension of classical graph col...
188
click to vote
AE
1999
Springer
15 years 11 months ago
1999
Springer
The performance of decoder-based evolutionary algorithms (EAs) strongly depends on the locality of the used decoder and operators. While many approaches to characterize locality ar...
152
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
142
click to vote
CCCG
2007
15 years 8 months ago
2007
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...