Evolving Compression preprocessors with genetic programming
@InProceedings{Parent:2001:WSEAS,
author = "Johan Parent",
title = "Evolving Compression preprocessors with genetic
programming",
address = "Puerto De La Cruz, Tenerife, Spain",
year = "2001",
month = feb # "~11-15",
booktitle = "WSEAS NNA-FSFS-EC 2001",
pages = "paper ID number 275",
organisation = "The World Scientific and Engineering Academy and
Society (WSEAS)",
keywords = "genetic algorithms, genetic programming, Compression,
Entropy, Parallel, Lossless",
notes = "www.wseas.com/2001.xls",
}
Evolving Compression Preprocessors With Genetic Programming
@InProceedings{parent:2002:gecco,
author = "Johan Parent and Ann Nowe",
title = "Evolving Compression Preprocessors With Genetic
Programming",
booktitle = "GECCO 2002: Proceedings of the Genetic and
Evolutionary Computation Conference",
editor = "W. B. Langdon and E. Cant{\'u}-Paz and K. Mathias and
R. Roy and D. Davis and R. Poli and K. Balakrishnan and
V. Honavar and G. Rudolph and J. Wegener and
L. Bull and M. A. Potter and A. C. Schultz and J. F. Miller and
E. Burke and N. Jonoska",
year = "2002",
pages = "861--867",
address = "New York",
publisher_address = "San Francisco, CA 94104, USA",
month = "9-13 " # jul,
publisher = "Morgan Kaufmann Publishers",
keywords = "genetic algorithms, genetic programming",
ISBN = "1-55860-878-8",
URL = "http://www.cs.bham.ac.uk/~wbl/biblio/gecco2002/gp256.ps",
URL = "http://www.cs.bham.ac.uk/~wbl/biblio/gecco2002/gp256.pdf",
URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/gecco2002/gecco-2002-14.pdf",
notes = "GECCO-2002. A joint meeting of the eleventh
International Conference on Genetic Algorithms
(ICGA-2002) and the seventh Annual Genetic Programming
Conference (GP-2002)",
}
Addressing the Even-n-parity problem using Compressed Linear Genetic Programming
@InProceedings{Parent:gecco05lbp,
author = "Johan Parent and Annie Nowe and Anne Defaweux",
title = "Addressing the Even-n-parity problem using Compressed
Linear Genetic Programming",
booktitle = "Late breaking paper at Genetic and Evolutionary
Computation Conference {(GECCO'2005)}",
year = "2005",
month = "25-29 " # jun,
editor = "Franz Rothlauf",
address = "Washington, D.C., USA",
URL = "http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005lbp/papers/54-parent.pdf",
keywords = "genetic algorithms, genetic programming, modules,
modularisation, building blocks",
abstract = "Compressed Linear Genetic Programming (cl-GP) uses
substring compression as a modularisation scheme.
Despite the fact that the compression of substrings
assumes a tight linkage between alleles, this approach
improves the GP search process. The compression of the
genotype, which is a form of linkage learning, provides
both a protection mechanism and a form of genetic code
reuse. This text presents the results obtained with the
cl-GP on the Even-n-parity problem. Results indicate
that the modularization of the cl-GP performs better
than a normal l-GP as it allows the cl-GP to preserve
useful gene combinations. Additionally the cl-GP
modularisation is well suited for problems where the
problem size is adjusted in a co-evolutionary setup,
the problem size increases each time a solution is
found",
notes = "Distributed on CD-ROM at GECCO-2005
Pairs of adjacent functions and/or terminals present in
large numbers in 10 fit programs may be replaced by a
single symbol before crossover and mutation. The
intention being to keep them together as a building
block.
Representation is a linearised (depth first) tree. Non
standard meaning given to {"}co-evolutionary{"}.
Up to even-10-parity evolved (cf \cite{poli:1999:22par}
22 parity). Tight limit on program size. NOOP.
Elitism.
Why does size of dictionary rise after generation
zero?",
}
Compressed Linear Genetic Programming: empirical parameter study on the Even-n-parity problem
@InProceedings{parent:2005:bnaic,
author = "Johan Parent and Ann Nowe and Anne Defaweux and
Kris Steenhaut",
title = "Compressed Linear Genetic Programming: empirical
parameter study on the Even-n-parity problem",
booktitle = "Proceedings of the Seventeenth Belgium/Netherlands
Conference on Artificial Intelligence (BNAIC 2005)",
year = "2005",
editor = "Katja Verbeeck and Karl Tuyls and Ann Nowe and
Bernard Manderick and Bart Kuijpers",
pages = "373--374",
address = "Koninklijke Vlaamse Academie van Belgie voor
Wetenschappen en Kunsten, Brussel, Belgium",
month = "17-18 " # oct,
organisation = "BNVKI, Dutch and the Belgian AI Association",
publisher = "Royal Flemish Academy of Belgium for Science and Arts,
KVAB",
keywords = "genetic algorithms, genetic programming",
size = "2 pages",
notes = "2 page summary",
}
Linear Genetic Programming using a compressed genotype representation
@InProceedings{parent:2005:CEC,
author = "Johan Parent and Ann Nowe and Kris Steenhaut and
Anne Defaweux",
title = "Linear Genetic Programming using a compressed genotype
representation",
booktitle = "Proceedings of the 2005 IEEE Congress on Evolutionary
Computation",
year = "2005",
editor = "David Corne and Zbigniew Michalewicz and
Marco Dorigo and Gusz Eiben and David Fogel and Carlos Fonseca and
Garrison Greenwood and Tan Kay Chen and
Guenther Raidl and Ali Zalzala and Simon Lucas and Ben Paechter and
Jennifier Willies and Juan J. Merelo Guervos and
Eugene Eberbach and Bob McKay and Alastair Channon and
Ashutosh Tiwari and L. Gwenn Volkert and
Dan Ashlock and Marc Schoenauer",
volume = "2",
pages = "1164--1171",
address = "Edinburgh, UK",
publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ
08855-1331, USA",
month = "2-5 " # sep,
organisation = "IEEE Computational Intelligence Society, Institution
of Electrical Engineers (IEE), Evolutionary Programming
Society (EPS)",
publisher = "IEEE Press",
keywords = "genetic algorithms, genetic programming",
ISBN = "0-7803-9363-5",
abstract = "a modularisation strategy for linear genetic
programming (GP) based on a substring
compression/substitution scheme. The purpose of this
substitution scheme is to protect building blocks and
is in other words a form of learning linkage. The
compression of the genotype provides both a protection
mechanism and a form of genetic code reuse. This paper
presents results for synthetic genetic algorithm (GA)
reference problems like SEQ and OneMax as well as
several standard GP problems. These include a real
world application of GP to data compression. Results
show that despite the fact that the compression
substrings assumes a tight linkage between alleles,
this approach improves the search process.",
notes = "CEC2005 - A joint meeting of the IEEE, the IEE, and
the EPS.",
}
Adaptive Load Balancing of Parallel Applications with Multi-Agent Reinforcement Learning on Heterogeneous Systems
@article{ parent-adaptive,
author = "Johan PARENT and Katja VERBEECK and Ann NOWE and Kris STEENHAUT and Jan LEMEIRE and Erik DIRKX",
title = "Adaptive Load Balancing of Parallel Applications with Multi-Agent Reinforcement Learning on Heterogeneous Systems",
year = "2004",
volume = "12",
number = "2",
pages = "71--79",
publisher = "IOS Press",
url = "citeseer.ist.psu.edu/587114.html" }
@inproceedings{TXY04,
author = {},
title = {},
booktitle = {Proceedings of 2003 International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES 2003)},
year = {2003},
pages = {--},
address = {WuXi, China},
month = {September},
publisher = {Hubei Science and Technology Press},
url = {},
}
The Small League RoboCup Team of the VUB AI-Lab
@inproceedings{698214,
author = {Andreas Birk and Thomas Walle and Tony Belpaeme and Johan Parent and Tom De Vlaminck and Holger Kenn},
title = {The Small League RoboCup Team of the VUB AI-Lab},
booktitle = {RoboCup-98: Robot Soccer World Cup II},
year = {1999},
isbn = {3-540-66320-7},
pages = {410--415},
publisher = {Springer-Verlag},
address = {London, UK},
}
Learning to Reach the Pareto Optimal Nash Equilibrium as a Team
@inproceedings{676365,
author = {Katja Verbeeck and Ann Now\&\#233; and Tom Lenaerts and Johan Parent},
title = {Learning to Reach the Pareto Optimal Nash Equilibrium as a Team},
booktitle = {AI '02: Proceedings of the 15th Australian Joint Conference on Artificial Intelligence},
year = {2002},
isbn = {3-540-00197-2},
pages = {407--418},
publisher = {Springer-Verlag},
address = {London, UK},
}
Transition models as an incremental approach for problem solving in evolutionary algorithms
@inproceedings{1068110,
author = {Anne Defaweux and Tom Lenaerts and Jano van Hemert and Johan Parent},
title = {Transition models as an incremental approach for problem solving in evolutionary algorithms},
booktitle = {GECCO '05: Proceedings of the 2005 conference on Genetic and evolutionary computation},
year = {2005},
isbn = {1-59593-010-8},
pages = {599--606},
location = {Washington DC, USA},
doi = {http://doi.acm.org/10.1145/1068009.1068110},
publisher = {ACM Press},
address = {New York, NY, USA},
}
Social Agents Playing a Periodical Policy
@inproceedings{650029,
author = {Ann Now\&\#233; and Johan Parent and Katja Verbeeck},
title = {Social Agents Playing a Periodical Policy},
booktitle = {EMCL '01: Proceedings of the 12th European Conference on Machine Learning},
year = {2001},
isbn = {3-540-42536-5},
pages = {382--393},
publisher = {Springer-Verlag},
address = {London, UK},
}