Evolving Distributed Algorithms with Genetic Programming: Election

被引：0

作者：

Weise, Thomas ^{[1
]}

Zapf, Michael ^{[1
]}

机构：

[1] Univ Kassel, Distributed Syst Grp, D-34121 Kassel, Germany

来源：

WORLD SUMMIT ON GENETIC AND EVOLUTIONARY COMPUTATION (GEC 09) | 2009年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：577 / 584

页数：8

共 42 条

[1]

[Anonymous], 1997, ANIMAL GROUPS 3 DIME

[2]

[Anonymous], 2009, GLOBAL OPTIMIZATION

[3]

[Anonymous], 2003, Genetic programming IV: routine human-competitive machine intelligence

[4]

Back T., 1996, EVOLUTIONARY ALGORIT, DOI DOI 10.1093/OSO/9780195099713.001.0001

[5]

Bleuler S, 2001, IEEE C EVOL COMPUTAT, P536, DOI 10.1109/CEC.2001.934438

[6]

Branke J, 1998, LECT NOTES COMPUT SC, V1498, P119, DOI 10.1007/BFb0056855

[7] IMPROVED ALGORITHM FOR DECENTRALIZED EXTREMA-FINDING IN CIRCULAR CONFIGURATIONS OF PROCESSES [J].

CHANG, E ;

ROBERTS, R .

COMMUNICATIONS OF THE ACM, 1979, 22 (05) :281-283

[8] An unsolvable problem of elementary number theory [J].

Church, A .

AMERICAN JOURNAL OF MATHEMATICS, 1936, 58 :345-363

[9] Overfitting and undercomputing in machine learning [J].

Dietterich, T .

ACM COMPUTING SURVEYS, 1995, 27 (03) :326-327

[10] On the interpretation of x(2) from contingency tables, and the calculation of P [J].

Fisher, RA .

JOURNAL OF THE ROYAL STATISTICAL SOCIETY, 1922, 85 :87-94

← 1 2 3 4 5 →