Article

Free access

Collective memory search

Author:

Thomas HaynesAuthors Info & Claims

SAC '97: Proceedings of the 1997 ACM symposium on Applied computing

Pages 217 - 222

https://doi.org/10.1145/331697.331743

Published: 01 April 1997 Publication History

PDF eReader

References

[1]

Iqenneth A. DeJong. Genetic-algorithm-based learning. In Y. I(odratoff and R. S. Michalski, editors, :lIachine Learning, l/~lume {{I. Morgan I(aufmann, Los Alamos. CA, 1990.

Google Scholar

[2]

Marco Dorigo, Vittorio *'{aniezzo, and Alberto Colorni. The Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man. and Cybernetics Part B: Cybernetics, 26( 1):29-41, 1996.

Digital Library

Google Scholar

[3]

:Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP. Completeness. W.H. Freeman and Co., San Francisco, CA, 1979.

Digital Library

Google Scholar

[4]

Andrew Garland and Richard Alterman. Multiagent learning through collective memory. In Sandip Sen, editor, Working Notes for the .4AA{ Symposium on Adaptation, Co.evolution and Learning in,llultiagent Systems, pages 33-38. Stanford Universit, y. CA. Nlarch 1996.

Google Scholar

[5]

Thomas Haynes. Duplication of coding segments in genetic programming. In Proceedings of the Thirteenth National Conference on .4rtificiai Intelligence, Portland, OR, August 1996.

Digital Library

Google Scholar

[6]

Thomas Haynes, Dale Schoenefeld. and Roger Wainwright. Type inheritance in strongly typed genetic programming. In Kenneth E. I(innear, Jr. and Peter J. Angeline. editors, Advances in Genetic Programming 2, chapter 18. MIT Press, 1996.

Digital Library

Google Scholar

[7]

Thomas Haynes, Roger Wainwright, Sandip Sen, and Dale Schoenefeld. Strongly typed genetic programming in evolving cooperation strategies. In Larry Eshelman. editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 271-278, San Francisco, CA, 1995. Morgan Kaufmann Publishers, Inc.

Digital Library

Google Scholar

[8]

John H. Holland. Aclpatation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975.

Digital Library

Google Scholar

[9]

David S. Johnson and M. A. Trick. Cliques, coloring, and satisfiability: The second DIMACS challange. (to appear), 1993.

Google Scholar

[10]

John R. Koza. Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge, MA, 1992.

Digital Library

Google Scholar

[11]

David J. Montana. Strongly typed genetic programming. Evolutionary Computation, 3(2):199- 230, 1995. (Also published as BBN Technical Report #7866, Cambridge, MA, March 1994.).

Digital Library

Google Scholar

[12]

Una-May O'Reilly. An Analysis of Genetic Pro. gramming. PhD thesis, Carelton University, Ottawa-Carleton Institute for Computer Science, Ottawa, Ontario, Canada, 22 September 1995.

Digital Library

Google Scholar

[13]

Justinian Rosca and Dana H. Ballard. Discovery of subroutines in genetic programming. In P. Angeline and I(. E. Kinnear, Jr., editors, Advances in Genetic Programmin9 2, chapter 9. MIT Press, Cambridge, MA, USA. 1996.

Digital Library

Google Scholar

Cited By

View all

Haynes T(2005)Random search versus genetic programming as engines for collective adaptationEvolutionary Programming VII10.1007/BFb0040819(683-692)Online publication date: 10-Dec-2005
https://doi.org/10.1007/BFb0040819
Haynes TBryant BLamont GHaddad HCarroll J(1999)Distributing collective adaptation via message passingProceedings of the 1999 ACM symposium on Applied computing10.1145/298151.298429(501-505)Online publication date: 28-Feb-1999
https://dl.acm.org/doi/10.1145/298151.298429

Index Terms

Collective memory search

Recommendations

Collective adaptation: The exchange of coding segments

Coding segments are those subsegments of the chromosome that contribute positively to the fitness evaluation of the chromosome. Clique detection is a NP-complete problem in which we can detect such coding segments. We extract coding segments from ...
Distributed collective adaptation applied to a hard combinatorial optimization problem
SAC '99: Proceedings of the 1999 ACM symposium on Applied computing
Efficiently evolving programs through the search for novelty
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation

A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic programming a method that originated in neuroevolution (i.e. the evolution of ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SAC '97: Proceedings of the 1997 ACM symposium on Applied computing

April 1997

545 pages

ISBN:0897918509

DOI:10.1145/331697

Editors:
Barrett Bryant
Univ. of Alabama, Birmingham, AL
,
Janice Carroll
Sam Houston State Univ.
,
Dave Oppenheim,
Jim Hightower
California State Univ.-Fullerton, Fullerton, CA
,
K. M. George
Oklahoma State Univ.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC97

Sponsor:

SAC97: 1997 Symposium on Applied Computing

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
300
Total Downloads

Downloads (Last 12 months)23
Downloads (Last 6 weeks)10

Reflects downloads up to 04 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Haynes T(2005)Random search versus genetic programming as engines for collective adaptationEvolutionary Programming VII10.1007/BFb0040819(683-692)Online publication date: 10-Dec-2005
https://doi.org/10.1007/BFb0040819
Haynes TBryant BLamont GHaddad HCarroll J(1999)Distributing collective adaptation via message passingProceedings of the 1999 ACM symposium on Applied computing10.1145/298151.298429(501-505)Online publication date: 28-Feb-1999
https://dl.acm.org/doi/10.1145/298151.298429

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Collective adaptation: The exchange of coding segments

Distributed collective adaptation applied to a hard combinatorial optimization problem

Efficiently evolving programs through the search for novelty