Automatic generation of graph models for complex networks by genetic programming. Bailey, A., Ventresca, M., & Ombuki-Berman, B. M. In Soule, T. & Moore, J. H., editors, GECCO, pages 711-718, 2012. ACM. Link Paper bibtex @inproceedings{conf/gecco/BaileyVO12,
added-at = {2018-11-06T00:00:00.000+0100},
author = {Bailey, Alexander and Ventresca, Mario and Ombuki-Berman, Beatrice M.},
biburl = {https://www.bibsonomy.org/bibtex/2915f8a48a9f781a341af7aca59998fdc/dblp},
booktitle = {GECCO},
crossref = {conf/gecco/2012},
editor = {Soule, Terence and Moore, Jason H.},
ee = {https://doi.org/10.1145/2330163.2330263},
interhash = {f5c87122a9d57ec6eb8e8c418b28d375},
intrahash = {915f8a48a9f781a341af7aca59998fdc},
isbn = {978-1-4503-1177-9},
keywords = {dblp},
pages = {711-718},
publisher = {ACM},
timestamp = {2018-11-07T16:41:18.000+0100},
title = {Automatic generation of graph models for complex networks by genetic programming.},
url = {http://dblp.uni-trier.de/db/conf/gecco/gecco2012.html#BaileyVO12},
year = 2012
}
Downloads: 0
{"_id":"g22cPcvyCex2Pr6W4","bibbaseid":"bailey-ventresca-ombukiberman-automaticgenerationofgraphmodelsforcomplexnetworksbygeneticprogramming-2012","author_short":["Bailey, A.","Ventresca, M.","Ombuki-Berman, B. M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2018-11-06T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Bailey"],"firstnames":["Alexander"],"suffixes":[]},{"propositions":[],"lastnames":["Ventresca"],"firstnames":["Mario"],"suffixes":[]},{"propositions":[],"lastnames":["Ombuki-Berman"],"firstnames":["Beatrice","M."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2915f8a48a9f781a341af7aca59998fdc/dblp","booktitle":"GECCO","crossref":"conf/gecco/2012","editor":[{"propositions":[],"lastnames":["Soule"],"firstnames":["Terence"],"suffixes":[]},{"propositions":[],"lastnames":["Moore"],"firstnames":["Jason","H."],"suffixes":[]}],"ee":"https://doi.org/10.1145/2330163.2330263","interhash":"f5c87122a9d57ec6eb8e8c418b28d375","intrahash":"915f8a48a9f781a341af7aca59998fdc","isbn":"978-1-4503-1177-9","keywords":"dblp","pages":"711-718","publisher":"ACM","timestamp":"2018-11-07T16:41:18.000+0100","title":"Automatic generation of graph models for complex networks by genetic programming.","url":"http://dblp.uni-trier.de/db/conf/gecco/gecco2012.html#BaileyVO12","year":"2012","bibtex":"@inproceedings{conf/gecco/BaileyVO12,\n added-at = {2018-11-06T00:00:00.000+0100},\n author = {Bailey, Alexander and Ventresca, Mario and Ombuki-Berman, Beatrice M.},\n biburl = {https://www.bibsonomy.org/bibtex/2915f8a48a9f781a341af7aca59998fdc/dblp},\n booktitle = {GECCO},\n crossref = {conf/gecco/2012},\n editor = {Soule, Terence and Moore, Jason H.},\n ee = {https://doi.org/10.1145/2330163.2330263},\n interhash = {f5c87122a9d57ec6eb8e8c418b28d375},\n intrahash = {915f8a48a9f781a341af7aca59998fdc},\n isbn = {978-1-4503-1177-9},\n keywords = {dblp},\n pages = {711-718},\n publisher = {ACM},\n timestamp = {2018-11-07T16:41:18.000+0100},\n title = {Automatic generation of graph models for complex networks by genetic programming.},\n url = {http://dblp.uni-trier.de/db/conf/gecco/gecco2012.html#BaileyVO12},\n year = 2012\n}\n\n","author_short":["Bailey, A.","Ventresca, M.","Ombuki-Berman, B. M."],"editor_short":["Soule, T.","Moore, J. H."],"key":"conf/gecco/BaileyVO12","id":"conf/gecco/BaileyVO12","bibbaseid":"bailey-ventresca-ombukiberman-automaticgenerationofgraphmodelsforcomplexnetworksbygeneticprogramming-2012","role":"author","urls":{"Link":"https://doi.org/10.1145/2330163.2330263","Paper":"http://dblp.uni-trier.de/db/conf/gecco/gecco2012.html#BaileyVO12"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/mario ventresca?items=1000","dataSources":["RLFDMZMWW7Ps5vpgQ","Ck8iJJ5zmAj377iYj","aABj84ppQaei4P3aS"],"keywords":["dblp"],"search_terms":["automatic","generation","graph","models","complex","networks","genetic","programming","bailey","ventresca","ombuki-berman"],"title":"Automatic generation of graph models for complex networks by genetic programming.","year":2012}