Inproceedings,
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage.
K. Sastry, and D. Goldberg.GECCO, volume 2724 of Lecture Notes in Computer Science, page 1332-1344. Springer, (2003)
Meta data
- BibTeX key
- conf/gecco/SastryG03
- entry type
- inproceedings
- booktitle
- GECCO
- year
- 2003
- pages
- 1332-1344
- publisher
- Springer
- series
- Lecture Notes in Computer Science
- volume
- 2724
- crossref
- conf/gecco/2003-2
- ee
- https://doi.org/10.1007/3-540-45110-2_8
- isbn
- 3-540-40603-4
- url
- http://dblp.uni-trier.de/db/conf/gecco/gecco2003-2.html#SastryG03
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/gecco/SastryG03
%A Sastry, Kumara
%A Goldberg, David E.
%B GECCO
%D 2003
%E Cantú-Paz, Erick
%E Foster, James A.
%E Deb, Kalyanmoy
%E Davis, Lawrence
%E Roy, Rajkumar
%E O'Reilly, Una-May
%E Beyer, Hans-Georg
%E Standish, Russell K.
%E Kendall, Graham
%E Wilson, Stewart W.
%E Harman, Mark
%E Wegener, Joachim
%E Dasgupta, Dipankar
%E Potter, Mitchell A.
%E Schultz, Alan C.
%E Dowsland, Kathryn A.
%E Jonoska, Natasa
%E Miller, Julian F.
%I Springer
%K dblp
%P 1332-1344
%T Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage.
%U http://dblp.uni-trier.de/db/conf/gecco/gecco2003-2.html#SastryG03
%V 2724
%@ 3-540-40603-4
@inproceedings{conf/gecco/SastryG03,
added-at = {2017-05-23T00:00:00.000+0200},
author = {Sastry, Kumara and Goldberg, David E.},
biburl = {https://www.bibsonomy.org/bibtex/20bdc2f6a134a4e6220cca833842d5483/dblp},
booktitle = {GECCO},
crossref = {conf/gecco/2003-2},
editor = {Cantú-Paz, Erick and Foster, James A. and Deb, Kalyanmoy and Davis, Lawrence and Roy, Rajkumar and O'Reilly, Una-May and Beyer, Hans-Georg and Standish, Russell K. and Kendall, Graham and Wilson, Stewart W. and Harman, Mark and Wegener, Joachim and Dasgupta, Dipankar and Potter, Mitchell A. and Schultz, Alan C. and Dowsland, Kathryn A. and Jonoska, Natasa and Miller, Julian F.},
ee = {https://doi.org/10.1007/3-540-45110-2_8},
interhash = {caa7227d163b9e8f9815a1eed1f6b406},
intrahash = {0bdc2f6a134a4e6220cca833842d5483},
isbn = {3-540-40603-4},
keywords = {dblp},
pages = {1332-1344},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T19:41:50.000+0200},
title = {Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage.},
url = {http://dblp.uni-trier.de/db/conf/gecco/gecco2003-2.html#SastryG03},
volume = 2724,
year = 2003
}