1310 search results - page 69 / 262 » A parallel genetic algorithm to solve the set-covering probl... |
PDP
2003
IEEE
15 years 3 months ago
2003
IEEE
The paper presents a Coarse-Grained Multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with È processors in ...
ICTAI
2009
IEEE
15 years 4 months ago
2009
IEEE
Evolutionary computation methods have been used to solve several optimization and learning problems. This paper describes an application of evolutionary computation methods to con...
IWANN
2009
Springer
15 years 4 months ago
2009
Springer
This paper proposes a new evolutionary method for generating ANNs. In this method, a simple real-number string is used to codify both architecture and weights of the networks. Ther...
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper describes a new approach for parameter optimization that uses a novel representation for the parameters to be optimized. By using genetic programming, the new ...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...