• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Evolving Distributed Algorithms with Genetic Programming: Election (2009)

Cached

  • Download as a PDF

Download Links

  • [www.it-weise.de]
  • [www.it-weise.de]
  • [www.it-weise.de]
  • [www.it-weise.de]
  • [www.it-weise.de]
  • [kobra.bibliothek.uni-kassel.de]
  • [d-nb.info]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Thomas Weise , Michael Zapf
Citations:10 - 7 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Weise09evolvingdistributed,
    author = {Thomas Weise and Michael Zapf},
    title = {Evolving Distributed Algorithms with Genetic Programming: Election},
    year = {2009}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

In this paper, we present a detailed analysis of the application of Genetic Programming to the evolution of distributed algorithms. This research field has many facets which make it especially difficult. These aspects are discussed and countermeasures are provided. Six different Genetic Programming approaches (SGP,eSGP,LGP,RBGP,eRBGP, and Fraglets) are applied to the election problem as case study utilizing these countermeasures. The results of the experiments are analyzed statistically and discussed thoroughly.

Keyphrases

genetic programming    research field    distributed algorithm    different genetic programming approach    detailed analysis    case study    many facet    election problem   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University