Genetic Algorithms for Word Problems in Partially Commutative Groups

Details Genetic Algorithms for Word Problems in Partially Commutative Groups Genetic Algorithms for Word Problems in Partially Commutative Groups

2004-05-20

arxiv.org/abs/math/0405396v2

LNCS 4446, Springer-Verlag (2007), 48--59

Mathematics

Group Theory

12 pages; several changes/improvements, publication version

Scientific paper

We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial optimisation. We obtain a method applicable to a wide range of problems and give results which indicate good behaviour of the genetic algorithm, hinting at the presence of a new deterministic solution and a framework for further results.

Affiliated with

Also associated with

No associations

Rating

Genetic Algorithms for Word Problems in Partially Commutative Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Genetic Algorithms for Word Problems in Partially Commutative Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Genetic Algorithms for Word Problems in Partially Commutative Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-552231