Abstract
Genetic algorithms (GAs) are efficient non-gradient stochastic search methods. Parallel GAs are proposed to overcome the deficiencies of sequential GAs, such as low speed and aptness to locally converge. However the tremendous communication cost incurred offsets the advantages of parallel GAs. Hence reducing communication cost is the key issue of this problem. Instead of reducing the communication cost simply by compressing the size of the messages, we tackle the problem by improving the effectiveness of the schema to be disseminated. We propose a new schema migration scheme (SMS). This SMS consists of a schema extracting mechanism and a schema disseminating mechanism. This SMS is valid and requires less communication cost.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
