@article{Mills&al1980, title = {The management of software engineering}, author = {H. D. Mills and D. O'Neill}, journal = {IBM Systems Journal}, number = {2}, pages = {414--477}, volume = {24}, year = {1980}, biburl = {http://www.bibsonomy.org/bibtex/2429570f36c901cf3783f75915f236f76/pdeleenh}, timestamp = {2008.05.15}, owner = {pdeleenh}, keywords = {engineering software } } @inbook{marshall1, title = {"Cornwallis triumphant": war in India and the British public in the late eighteenth century}, address = {Oxford }, author = {Peter James Marshall}, booktitle = {War, strategy, and international politics: essays in honour of Sir Michael Howard }, editor = {Lawrence Freedman and Paul Hayes and Robert O'Neill}, publisher = {Clarendon Press }, url = {http://lib.leeds.ac.uk/record=b1304523}, year = {1992}, biburl = {http://www.bibsonomy.org/bibtex/29723ca1d880ce12debbf134f9e3ca00a/klinch}, keywords = {HIST3718 Impact_of_War } } @inproceedings{conf/evoW/FradeVC08, title = {Modelling Video Games' Landscapes by Means of Genetic Terrain Programming - A New Approach for Improving Users' Experience.}, author = {Miguel Frade and Francisco Fernández de Vega and Carlos Cotta}, booktitle = {EvoWorkshops}, crossref = {conf/evoW/2008}, editor = {Mario Giacobini and Anthony Brabazon and Stefano Cagnoni and Gianni Di Caro and Rolf Drechsler and Anikó Ekárt and Anna Esparcia-Alcázar and Muddassar Farooq and Andreas Fink and Jon McCormack and Michael O'Neill and Juan Romero and Franz Rothlauf and Giovanni Squillero and Sima Uyar and Shengxiang Yang}, pages = {485-490}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, url = {http://dblp.uni-trier.de/db/conf/evoW/evoW2008.html#FradeVC08}, volume = {4974}, year = {2008}, biburl = {http://www.bibsonomy.org/bibtex/2c8efe29ec25e249dcd5bbe33b5f51c1d/dblp}, description = {dblp}, date = {2008-07-02}, ee = {http://dx.doi.org/10.1007/978-3-540-78761-7_52}, isbn = {978-3-540-78760-0}, keywords = {dblp } } @inproceedings{eurogp07:jwalker2, title = {Changing the Genospace: Solving {GA} Problems with Cartesian Genetic Programming}, address = {Valencia, Spain}, author = {James Alfred Walker and Julian Francis Miller}, booktitle = {Proceedings of the 10th European Conference on Genetic Programming}, editor = {Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar}, month = {11 - 13 April}, pages = {261--270}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {4445}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/2b110ff3e43c82f62bcc8f1c9b018a06b/brazovayeye}, abstract = {Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) capable of acquiring, evolving and re-using partial solutions. In this paper, we apply for the first time CGP and ECGP to the ones-max and order-3 deceptive problems, which are normally associated with Genetic Algorithms. Our approach uses CGP and ECGP to evolve a sequence of commands for a tape-head, which produces an arbitrary length binary string on a piece of tape. Computational effort figures are calculated for CGP and ECGP and our results compare favourably with those of Genetic Algorithms.}, isbn = {3-540-71602-5}, isbn13 = {978-3-540-71602-0}, notes = {Part of \cite{ebner:2007:GP} EuroGP'2007 held in conjunction with EvoCOP2007, EvoBIO2007 and EvoWorkshops2007}, doi = {doi:10.1007/978-3-540-71605-1_24}, keywords = {algorithms, genetic programming } } @inproceedings{eurogp07:jwalker1, title = {Predicting Prime Numbers Using Cartesian Genetic Programming}, address = {Valencia, Spain}, author = {James Alfred Walker and Julian Francis Miller}, booktitle = {Proceedings of the 10th European Conference on Genetic Programming}, editor = {Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar}, month = {11 - 13 April}, pages = {205--216}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {4445}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/250e913313600081d96e4765ea030059e/brazovayeye}, abstract = {Prime generating polynomial functions are known that can produce sequences of prime numbers (e.g. Euler polynomials). However, polynomials which produce consecutive prime numbers are much more difficult to obtain. In this paper, we propose approaches for both these problems. The first uses Cartesian Genetic Programming (CGP) to directly evolve integer based prime-prediction mathematical formulae. The second uses multi-chromosome CGP to evolve a digital circuit, which represents a polynomial. We evolved polynomials that can generate 43 primes in a row. We also found functions capable of producing the first 40 consecutive prime numbers, and a number of digital circuits capable of predicting up to 208 consecutive prime numbers, given consecutive input values. Many of the formulae have been previously unknown.}, isbn = {3-540-71602-5}, isbn13 = {978-3-540-71602-0}, notes = {Part of \cite{ebner:2007:GP} EuroGP'2007 held in conjunction with EvoCOP2007, EvoBIO2007 and EvoWorkshops2007}, doi = {doi:10.1007/978-3-540-71605-1_19}, keywords = {algorithms, genetic programming } } @inproceedings{vanyi:2004:gew:rvan, title = {Syntactically Correct Genetic Programming}, address = {Seattle, Washington, USA}, author = {Robert Vanyi and Szilvia Zvada}, booktitle = {GECCO 2004 Workshop Proceedings}, editor = {R. Poli and S. Cagnoni and M. Keijzer and E. Costa and F. Pereira and G. Raidl and S. C. Upton and D. Goldberg and H. Lipson and E. {de Jong} and J. Koza and H. Suzuki and H. Sawai and I. Parmee and M. Pelikan and K. Sastry and D. Thierens and W. Stolzmann and P. L. Lanzi and S. W. Wilson and M. O'Neill and C. Ryan and T. Yu and J. F. Miller and I. Garibay and G. Holifield and A. S. Wu and T. Riopka and M. M. Meysenburg and A. W. Wright and N. Richter and J. H. Moore and M. D. Ritchie and L. Davis and R. Roy and M. Jakiela}, month = {26-30 June}, url = {http://www.cs.bham.ac.uk/~wbl/biblio/gecco2004/WGEW004.pdf}, year = {2004}, biburl = {http://www.bibsonomy.org/bibtex/212aecf3c73f5ae086a9d5da7ea6cea10/brazovayeye}, notes = {GECCO-2004WKS Distributed on CD-ROM at GECCO-2004}, keywords = {algorithms, evolution genetic grammatical programming, } } @inproceedings{eurogp07:vanneschi, title = {A Comprehensive View of Fitness Landscapes with Neutrality and Fitness Clouds}, address = {Valencia, Spain}, author = {Leonardo Vanneschi and Marco Tomassini and Philippe Collard and S\'ebastien Verel and Yuri Pirola and Giancarlo Mauri}, booktitle = {Proceedings of the 10th European Conference on Genetic Programming}, editor = {Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar}, month = {11 - 13 April}, pages = {241--250}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {4445}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/2c40f6ed6b3646a2cfce60975c0175b42/brazovayeye}, abstract = {We define a set of measures that capture some different aspects of neutrality in evolutionary algorithms fitness landscapes from a qualitative point of view. If considered all together, these measures offer a rather complete picture of the characteristics of fitness landscapes bound to neutrality and may be used as broad indicators of problem hardness. We compare the results returned by these measures with the ones of negative slope coefficient, a quantitative measure of problem hardness that has been recently defined and with success rate statistics on a well known genetic programming benchmark: the multiplexer problem. In order to efficaciously study the search space, we use a sampling technique that has recently been introduced and we show its suitability on this problem.}, isbn = {3-540-71602-5}, isbn13 = {978-3-540-71602-0}, notes = {Part of \cite{ebner:2007:GP} EuroGP'2007 held in conjunction with EvoCOP2007, EvoBIO2007 and EvoWorkshops2007}, doi = {doi:10.1007/978-3-540-71605-1_22}, keywords = {algorithms, genetic programming } } @inproceedings{Suarez:gecco05ws, title = {Evolving Object Oriented Agent Programs in Robocup Domain}, address = {Washington, D.C., USA}, author = {David Enrique {Suarez Pinzon} and Julian Yezid {Olarte Ramos} and Sergio Andres {Rojas Galeano}}, booktitle = {Genetic and Evolutionary Computation Conference {(GECCO2005)} workshop program}, editor = {Franz Rothlauf and Misty Blowers and J{\"u}rgen Branke and Stefano Cagnoni and Ivan I. Garibay and Ozlem Garibay and J{\"o}rn Grahl and Gregory Hornby and Edwin D. {de Jong} and Tim Kovacs and Sanjeev Kumar and Claudio F. Lima and Xavier Llor{\`a} and Fernando Lobo and Laurence D. Merkle and Julian Miller and Jason H. Moore and Michael O'Neill and Martin Pelikan and Terry P. Riopka and Marylyn D. Ritchie and Kumara Sastry and Stephen L. Smith and Hal Stringer and Keiki Takadama and Marc Toussaint and Stephen C. Upton and Alden H. Wright}, month = {25-29 June}, pages = {407--410}, publisher = {ACM Press}, url = {http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005wks/papers/0407.pdf}, year = {2005}, biburl = {http://www.bibsonomy.org/bibtex/260566654e35daa3371da9d97768b2495/brazovayeye}, abstract = {We describe the application of object oriented genetic programming to the automatic generation of agents under the Object Oriented Paradigm. To generate the agent programs code, we evolve concurrently the methods that represent the agent-environment interaction. We use like terminals and operations the objects that correspond to the context elements. This study uses the simulation league of the Robot World Cup (Robocup) like a testing environment. The fitness function used evaluates the behavior of agent player in several levels that indicates the learning progress. The experimental results indicate that is possible the agent programs evolution under the Object Oriented Paradigm.}, notes = {Distributed on CD-ROM at GECCO-2005. ACM 1-59593-097-3/05/0006}, keywords = {algorithms, genetic programming } } @inproceedings{eurogp07:smart, title = {Empirical Analysis of {GP} Tree-Fragments}, address = {Valencia, Spain}, author = {Will Smart and Peter Andreae and Mengjie Zhang}, booktitle = {Proceedings of the 10th European Conference on Genetic Programming}, editor = {Marc Ebner and Michael O'Neill and Anik\'o Ek\'art and Leonardo Vanneschi and Anna Isabel Esparcia-Alc\'azar}, month = {11 - 13 April}, pages = {55--67}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {4445}, year = {2007}, biburl = {http://www.bibsonomy.org/bibtex/20280e332cfd50763931f6253f4c8465f/brazovayeye}, abstract = {Researchers have attempted to explain the power of Genetic Programming (GP) search using various notions of schema. However empirical studies of schemas have been limited due to their vast numbers in typical populations. This paper addresses the problem of analysing schemas represented by tree-fragments. It describes a new efficient way of representing the huge sets of fragments in a population of GP programs and presents an algorithm to find all fragments using this efficient representation. Using this algorithm, the paper presents an initial analysis of fragments in populations of up to 300 programs, each up to seven nodes deep. The analysis demonstrates a surprisingly large variation in the numbers of fragments through evolution and a non-monotonic rise in the most useful fragments. With his method, empirical investigation of the GP building block hypothesis and schema theory in realistic sized GP systems becomes possible.}, isbn = {3-540-71602-5}, isbn13 = {978-3-540-71602-0}, notes = {Part of \cite{ebner:2007:GP} EuroGP'2007 held in conjunction with EvoCOP2007, EvoBIO2007 and EvoWorkshops2007}, doi = {doi:10.1007/978-3-540-71605-1_6}, keywords = {algorithms, genetic programming } } @inproceedings{Siccama:gecco05ws, title = {Genetic Programming as a Method to Develop Powerful Predictive Models for Clinical Diagnosis}, address = {Washington, D.C., USA}, author = {Ivar Siccama and Maarten Keijzer}, booktitle = {Genetic and Evolutionary Computation Conference {(GECCO2005)} workshop program}, editor = {Franz Rothlauf and Misty Blowers and J{\"u}rgen Branke and Stefano Cagnoni and Ivan I. Garibay and Ozlem Garibay and J{\"o}rn Grahl and Gregory Hornby and Edwin D. {de Jong} and Tim Kovacs and Sanjeev Kumar and Claudio F. Lima and Xavier Llor{\`a} and Fernando Lobo and Laurence D. Merkle and Julian Miller and Jason H. Moore and Michael O'Neill and Martin Pelikan and Terry P. Riopka and Marylyn D. Ritchie and Kumara Sastry and Stephen L. Smith and Hal Stringer and Keiki Takadama and Marc Toussaint and Stephen C. Upton and Alden H. Wright}, month = {25-29 June}, pages = {164--166}, publisher = {ACM Press}, url = {http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005wks/papers/0164.pdf}, year = {2005}, biburl = {http://www.bibsonomy.org/bibtex/29411646874338b00eec359c523333424/brazovayeye}, abstract = {In the field of medicine it is of vital importance to accurately predict the presence of a disease (diagnostic prediction)or the future occurrence of a certain event (prognostic prediction). Genetic programming provides a method to develop such prediction models in an optimal way. We discuss as an example the diagnostic prediction of pulmonary embolism (PE),and compare the method of genetic programming with the logistic regression technique, which is well-known in the medical field.}, notes = {Distributed on CD-ROM at GECCO-2005. ACM 1-59593-097-3/05/0006}, keywords = {algorithms, genetic programming } }