1830 search results - page 232 / 366 » Optimizing Sorting with Genetic Algorithms |
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
GECCO
2010
Springer
15 years 2 months ago
2010
Springer
This study proposes a simple computational model of evolutionary learning in organizations informed by genetic algorithms. Agents who interact only with neighboring partners seek ...
GECCO
2009
Springer
15 years 2 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
GECCO
2008
Springer
14 years 11 months ago
2008
Springer
We are interested in engineering smart machines that enable backtracking of emergent behaviors. Our SSNNS simulator consists of hand-picked tools to explore spiking neural network...