Voting Teams: A cooperative approach to non-typical
problems using genetic programming
T. Soule. Proceedings of the Genetic and Evolutionary
Computation Conference, 1, page 916--922. Orlando, Florida, USA, Morgan Kaufmann, (13-17 July 1999)
Abstract
even-7-parity XOR replaces NOR, population 500, 5
trees per individual, crossover like ADFs, size
secondary component of fitness, team's answer is
majority vote of five trees with in it. Robust to
crossover?
Performance of tree poor near random but whole team
good (NB don't solve even-7-parity). Teams (slightly)
smaller than one tree approach.
Proceedings of the Genetic and Evolutionary
Computation Conference
year
1999
month
13-17 July
pages
916--922
publisher
Morgan Kaufmann
volume
1
publisher_address
San Francisco, CA 94104, USA
isbn
1-55860-611-4
notes
GECCO-99 A joint meeting of the eighth international
conference on genetic algorithms (ICGA-99) and the
fourth annual genetic programming conference (GP-99)
%0 Conference Paper
%1 soule:1999:VTA
%A Soule, Terence
%B Proceedings of the Genetic and Evolutionary
Computation Conference
%C Orlando, Florida, USA
%D 1999
%E Banzhaf, Wolfgang
%E Daida, Jason
%E Eiben, Agoston E.
%E Garzon, Max H.
%E Honavar, Vasant
%E Jakiela, Mark
%E Smith, Robert E.
%I Morgan Kaufmann
%K algorithms, and evolution evolutionary genetic programming programming, strategies
%P 916--922
%T Voting Teams: A cooperative approach to non-typical
problems using genetic programming
%U http://www.cs.uidaho.edu/~tsoule/research/vote2.ps
%V 1
%X even-7-parity XOR replaces NOR, population 500, 5
trees per individual, crossover like ADFs, size
secondary component of fitness, team's answer is
majority vote of five trees with in it. Robust to
crossover?
Performance of tree poor near random but whole team
good (NB don't solve even-7-parity). Teams (slightly)
smaller than one tree approach.
%@ 1-55860-611-4
@inproceedings{soule:1999:VTA,
abstract = {even-7-parity XOR replaces NOR, population 500, 5
trees per individual, crossover like ADFs, size
secondary component of fitness, team's answer is
majority vote of five trees with in it. Robust to
crossover?
Performance of tree poor near random but whole team
good (NB don't solve even-7-parity). Teams (slightly)
smaller than one tree approach.},
added-at = {2008-06-19T17:35:00.000+0200},
address = {Orlando, Florida, USA},
author = {Soule, Terence},
biburl = {https://www.bibsonomy.org/bibtex/2ab21e145819872bec8dd5b670abf9796/brazovayeye},
booktitle = {Proceedings of the Genetic and Evolutionary
Computation Conference},
editor = {Banzhaf, Wolfgang and Daida, Jason and Eiben, Agoston E. and Garzon, Max H. and Honavar, Vasant and Jakiela, Mark and Smith, Robert E.},
interhash = {062451950832e676b1e5e31ee3d6c28c},
intrahash = {ab21e145819872bec8dd5b670abf9796},
isbn = {1-55860-611-4},
keywords = {algorithms, and evolution evolutionary genetic programming programming, strategies},
month = {13-17 July},
notes = {GECCO-99 A joint meeting of the eighth international
conference on genetic algorithms (ICGA-99) and the
fourth annual genetic programming conference (GP-99)},
pages = {916--922},
publisher = {Morgan Kaufmann},
publisher_address = {San Francisco, CA 94104, USA},
timestamp = {2008-06-19T17:52:00.000+0200},
title = {Voting Teams: {A} cooperative approach to non-typical
problems using genetic programming},
url = {http://www.cs.uidaho.edu/~tsoule/research/vote2.ps},
volume = 1,
year = 1999
}