844 search results - page 14 / 169 » Generalized crowding for genetic algorithms |
FLAIRS
2000
14 years 11 months ago
2000
We first revisit a problem in the literature of genetic algorithms: arranging numbers into groups whose summed weights are as nearly equal as possible. We provide a new genetic al...
95
Voted
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
95
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The importance of mutation varies across evolutionary computation domains including: genetic programming, evolution strategies, and genetic algorithms. In the genetic programming ...
53
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorith...
84
Voted
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...