Deriving a genome representation for evolving graph...

Details Deriving a genome representation for evolving graph... Deriving a genome representation for evolving graph...

2006-01-17

2006-01-17

Davis, Geprge (Department: 2129)

Data processing: artificial intelligence

Adaptive system

C706S013000

Reexamination Certificate

active

06988089

ABSTRACT:
A method for deriving a genome representation for the weights in a graph structure that increases the likelihood that solutions to substructures of the graph structure will be preserved during crossover operations. The preservation of solutions to substructures across generations of organisms may decrease the computational time when evolving to a desired solution.

REFERENCES:
Knowles et al, “A Comparison of Encodings and Algorithm for Multiobjective, Minimum Spanning Tree problems”, IEEE proceedings of the 2001 Congress on Evolutionary Computation, May 2001.
Hsieh et al, “Efficient parallel algorithms on Distance-Hereditary graphs”, IEEE proceedings of the 1997 International Conference on parallel processing, Aug. 1997.

Affiliated with

Also associated with

Rating

Deriving a genome representation for evolving graph... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Deriving a genome representation for evolving graph..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deriving a genome representation for evolving graph... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3552086