12015 search results - page 437 / 2403 » Interactive Algorithms 2005 |
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes a genetic algorithm (GA) that evolves optimized sets of coefficients for one-dimensional signal reconstruction under lossy conditions due to quantization. Beg...
145
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
This paper proposes a new algorithm based on the clonal selection principle for the design of spreading codes for DS-CDMA. The algorithm follows a multi-objective approach, genera...
132
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
141
click to vote
HM
2005
Springer
15 years 10 months ago
2005
Springer
A lot of heuristic approaches have been explored in the last two decades in order to tackle large size optimization problems. These areas include parallel meta-heuristics, hybrid m...
127
click to vote
HPCC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...