92 search results - page 10 / 19 » New heuristics for the maximum diversity problem |
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
We introduce the Spacing Memetic Algorithm (SMA), a formal evolutionary model devoted to a systematic control of spacing (distances) among individuals. SMA uses search space dista...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
SADM
2008
13 years 7 months ago
2008
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
AAAI
2000
13 years 8 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
BIBE
2005
IEEE
14 years 1 months ago
2005
IEEE
We have recently demonstrated (La et al, Proteins, 58:2005) that sequence fragments approximating the overall familial phylogeny, called phylogenetic motifs (PMs), represent a pro...