548 search results - page 79 / 110 » Using the Genetic Algorithm to Find Snake-in-the-Box Codes |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
ICSE
2008
IEEE-ACM
14 years 8 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
CSB
2003
IEEE
14 years 1 months ago
2003
IEEE
: The biological world is highly stochastic and inhomogeneous in its behaviour. There are regions in DNA with high concentration of G or C bases; stretches of sequences with an abu...
PPSN
2004
Springer
14 years 1 months ago
2004
Springer
A reasonably good description of the luminosity profiles of galaxies is needed as it serves as a guide towards understanding the process of galaxy formation and evolution. To obtai...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...