Author of the publication

Genetic Algorithms for Partitioning Sets.

. Int. J. Artif. Intell. Tools, 10 (1-2): 225-241 (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Schema disruption in tree-structured chromosomes.. GECCO, page 1401-1408. ACM, (2005)Genetic Algorithms for Partitioning Sets.. Int. J. Artif. Intell. Tools, 10 (1-2): 225-241 (2001)A tree-based genetic algorithm for building rectilinear Steiner arborescences.. GECCO, page 1179-1186. ACM, (2006)A Kernighan-Lin Local Improvement Heuristic that Softens Some Hard Problems in Genetic Algorithms.. GECCO Late Breaking Papers, page 201-206. AAAI, (2002)Using Galois fields in computer science (abstract only)., and . ACM Conference on Computer Science, page 418. ACM, (1985)Non-Linear Bit Arrangements in Genetic Algorithms. 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers, page 138--144. San Francisco, California, USA, (9-11 July 2001)A Non-Linear Schema Theorem for Genetic Algorithms. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), page 189--194. Las Vegas, Nevada, USA, Morgan Kaufmann, (10-12 July 2000)A Kernighan-Lin local improvement heuristic that softens several hard problems in genetic algorithms.. IEEE Congress on Evolutionary Computation, page 1006-1013. IEEE, (2003)Unsupervised hierarchical clustering via a genetic algorithm.. IEEE Congress on Evolutionary Computation, page 998-1005. IEEE, (2003)Partitioning Sets with Genetic Algorithms.. FLAIRS, page 102-106. AAAI Press, (2000)