By Topic

Evolving cellular automata by parallel quantum genetic algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Laboudi, Z. ; MISC Lab., Mentouri Univ., Constantine, Algeria ; Chikhi, S.

Evolving solutions rather than computing them certainly represents a promising programming approach. Evolutionary computation has already been known in computer science since more than 4 decades. More recently, another alternative of evolutionary algorithms was invented: quantum genetic algorithms. In this paper, we outline the approach of quantum genetic algorithm (QGA) by giving an example where it serves to automatically program cellular automata (CA) rules. Our results have shown that QGA can be a very promising tool for exploring CA search spaces.

Published in:

Networked Digital Technologies, 2009. NDT '09. First International Conference on

Date of Conference:

28-31 July 2009