213 search results - page 36 / 43 » A comparison of search heuristics for empirical code optimiz... |
HM
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. The maximum diversity problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
104
click to vote
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
122
click to vote
TIP
1998
14 years 11 months ago
1998
—We propose novel discrete cosine transform (DCT) pseudophase techniques to estimate shift/delay between two onedimensional (1-D) signals directly from their DCT coefficients by...
WCRE
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—Object-oriented (OO) software is usually organized into subsystems using the concepts of package or module. Such modular structure helps applications to evolve when faci...
133
click to vote
EUROGP
1998
Springer
15 years 3 months ago
1998
Springer
The problem of evolving, using mutation, an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Kn...