Global+Optimization+Algorithms+Theory+and+Application_Part36

Global+Optimization+Algorithms+Theory+and+Application_Part36...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: REFERENCES 701 [1257] Patrick LaRoche and A. Nur Zincir-Heywood. 802.11 network intrusion detection using genetic programming. In GECCO’05: Proceedings of the 2005 workshops on Genetic and evolutionary computation , pages 170–171, 2005. doi: 10.1145/1102256.1102295 . In proceedings [1766]. Online available at http://larocheonline.ca/ ~ plaroche/papers/gecco-laroche-heywood.pdf and http://doi.acm.org/10.1145/1102256.1102295 [accessed 2008-06-16] . [1258] Christian W. G. Lasarczyk and Wolfgang Banzhaf. An algorithmic chemistry for genetic programming. In Proceedings of the 8th European Conference on Genetic Programming , pages 1–12, 2005. In proceedings [1116]. Online avail- able at http://ls11-www.cs.uni-dortmund.de/downloads/papers/LaBa05.pdf and http://www.cs.bham.ac.uk/ ~ wbl/biblio/gp-html/eurogp_LasarczykB05. html [accessed 2008-04-30] . [1259] Christian W. G. Lasarczyk and Wolfgang Banzhaf. Total synthesis of algorith- mic chemistries. In GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation , volume 2, pages 1635–1640, 2005. In proceedings [199]. Online available at http://www.cs.bham.ac.uk/ ~ wbl/biblio/gecco2005/ docs/p1635.pdf and http://doi.acm.org/10.1145/1068009.1068285 [accessed 2008- 04-02] . [1260] J¨org L¨assig, Karl Heinz Hoffmann, and Mihaela En˘achescu. Threshold selecting: Best possible probability distribution for crossover selection in genetic algorithms. In Genetic and Evolutionary Computation Conference , pages 2181–2185, 2008. In proceedings [1117]. [1261] Marco Laumanns, Eckart Zitzler, and Lothar Thiele. A unified model for multi- objective evolutionary algorithms with elitism. In Proceedings of the 2000 Congress on Evolutionary Computation CEC00 , pages 46–53, 2000. In proceedings [1002]. Online available at http://citeseer.ist.psu.edu/laumanns00unified.html [accessed 2007- 08-27] . [1262] Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, and Eckart Zitzler. On the con- vergence and diversity-preservation properties of multi-objective evolutionary algo- rithms. Technical Report 108, Computer Engineering and Networks Laboratory (TIK), Department of Electrical Engineering, Swiss Federal Institute of Technology (ETH) Zurich and Kanpur Genetic Algorithms Laboratory (KanGAL), Department of Mechanical Engineering, Indian Institute of Technology Kanpur, Gloriastrasse 35, CH-8092 Zurich, Switzerland, 2001. Online available at http://e-collection. ethbib.ethz.ch/browse/alph/zitzlereckart.html and http://citeseer.ist. psu.edu/laumanns01convergence.html [accessed 2007-08-14] . [1263] E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization . Wiley Series in Discrete Mathematics & Optimization. Wiley Interscience, Chichester, UK, September 1985. ISBN: 0-4719-0413-9 , 978-0-47190-413-7 ....
View Full Document

{[ snackBarMessage ]}

Page1 / 20

Global+Optimization+Algorithms+Theory+and+Application_Part36...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online