Abstract
This proof of concept study examines the possibility of specifying the construction of programs using a Particle Swarm algorithm, and represents a new form of automatic programming based on Social Learning, Social Programming or Swarm Programming. Each individual particle represents choices of program construction rules, where these rules are specified using a Backus-Naur Form grammar. The results demonstrate that it is possible to generate programs using the Grammatical Swarm technique. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
O’Neill, M., & Brabazon, A. (2004). Grammatical Swarm. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3102, 163–174. https://doi.org/10.1007/978-3-540-24854-5_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
