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 available 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 algorithmic 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 200804-02].
[1260] Jörg Lässig, Karl Heinz Hoffmann, and Mihaela Enăchescu. 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 multiobjective 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 200708-27].
[1262] Marco Laumanns, Lothar Thiele, Kalyanmoy Deb, and Eckart Zitzler. On the convergence and diversity-preservation properties of multi-objective evolutionary algorithms. 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.
[1264] Gregory F. Lawler. Introduction to Stochastic Processes. Chapman & Hall/CRC
Press LLC, 2000 N.W. Corporate Blvd., Boca Raton, Florida 33431, USA, second
edition, July 1995. ISBN: 0-4129-9511-5, 978-1-58488-651-8.
[1265] Steve Lawrence and C. Lee Giles. Overfitting and neural networks: Conjugate gradient and backpropagation. In Proceedings of the IEEE-INNS-ENNS International
Joint Conference on Neural Networks (IJCNN’00), volume 1, pages 1114–1119. IEEE
Computer Society, July 24–27, 2000, Como, Italy. Online available at http://
citeseer.ist.psu.edu/lawrence00overfitting.html [accessed 2007-09-13].
[1266] A. C. G. Verdugo Lazo and P. N. Rathie. On the entropy of continuous probability
distributions. IEEE Transactions on Information Theory, 24(1):120–122, 1978.
[1267] Joshua Lederberg and Alexa T. McCray. ’ome sweet ’omics - a genealogical treasury
of words. The Scientist, 15(7):8, April 2001. Online available at http://lhncbc.
nlm.nih.gov/lhc/docs/published/2001/pub2001047.pdf [accessed 2007-08-06].
702
REFERENCES
[1268] Jack Yiu-Bun Lee and P. C. Wong.
The effect of function noise on
gp efficiency.
In Progress in Evolutionary Computation, pages 1–16, 1995.
doi:10.1007/3-540-60154-6 43. In proceedings [2282].
[1269] S. Lee, S. Soak, K. Kim, H. Park, and M. Jeon. Statistical properties analysis of real world tournament selection in genetic algorithms. Applied Intelligence, 28(2):195–205, April 2008. ISSN: 0924-669X (Print) 1573-7497 (Online).
doi:10.1007/s10489-007-0062-2. Online available at http://www.springerlink.com/
content/amr3nq330x13u32t/fulltext.pdf [accessed 2008-03-20].
[1270] Katharina Anna Lehmann and Michael Kaufmann.
Evolutionary algorithms
for the self-organized evolution of networks. In GECCO’05: Proceedings of the
2005 conference on Genetic and evolutionary computation, pages 563–570, 2005.
doi:10.1145/1068009.1068105. In proceedings [202]. Online available at http://
doi.acm.org/10.1145/1068009.1068105
and
http://www-pr.informatik.
uni-tuebingen.de/mitarbeiter/katharinazweig/downloads/299-lehmann.pdf
[accessed 2008-05-28]. Lehmann is now known as Zweig.
[1271] Derrick Henry Lehmer. Mathematical methods in large-scale computing units. Math.
Rev., 13(1):495, 1952.
[1272] Derrick Henry Lehmer. Mathematical methods in large-scale computing units. In
Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery,
1949, pages 141–146. Harvard University Press, 1951, Cambridge, MA, USA.
[1273] Kwong Sak Leung, Kin Hong Lee, and Sin Man Cheang. Genetic parallel programming – evolving linear machine codes on a multiple-alu processor. In S. Yaacob,
M. Nagarajan, and A. Chekima, editors, Proceedings of International Conference on
Artificial Intelligence in Engineering and Technology – ICAIET 2002, pages 207–213,
June 17–18, 2002, University of Malaysia Sabah, Kota Kinabalu, Sabah, Malaysia.
ISBN: 9-8321-8892-X. See http://hdl.handle.net/2006/187099 [accessed 2008-09-17].
[1274] Joel R. Levin. What if there were no more bickering about statistical significance
tests? Research in the Schools, 5(2):43–53, 1998. Online available at http://www.
personal.psu.edu/users/d/m/dmr/sigtest/6mspdf.pdf [accessed 2008-08-15].
[1275] David Levine. Application of a hybrid genetic algorithm to airline crew scheduling. Computers & Operations Research, 23(6):547–558, 1996. ISSN: 0305-0548. Online available at http://www.citeulike.org/user/ilapla/article/1443054 and
http://citeseer.ist.psu.edu/178394.html [accessed 2007-07-29].
[1276] Robert Michael Lewis, Virginia Joanne Torczon, and Michael W. Trosset. Direct
search methods: Then and now. Technical Report NASA/CR-2000-210125 and
ICASE Report No. 2000-26, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, Hampton, VA, USA (Operated by Universities Space Research Association), National Aeronautics and Space Administration
Langley Research Center Hampton, Virginia 23681-2199, May 2000. Online available
at http://historical.ncstrl.org/tr/pdf/icase/TR-2000-26.pdf [accessed 2008-0614].
[1277] Junyi Li and R. Russell Rhinehart.
Heuristic random optimization.
Computers and Chemical Engineering, 22(3):427–444, February 1998.
doi:10.1016/S0098-1354(97)00005-7. Received 10 August 1995; revised 28 March
1996.
[1278] Kangshun Li, Yuanxiang Li, Haifang Mo, and Zhangxin Chen. A new algorithm of
evolving artificial neural networks via gene expression programming. Journal of the
Korean Society for Industrial and Applied Mathematics, 9(2), 2005.
[1279] Rui Li, Michael T.M. Emmerich, Jeroen Eggermont, and Ernst G.P. Bovenkamp.
Mixed-integer optimization of coronary vessel image analysis using evolution strategies. In GECCO’06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 1645–1652, 2006. doi:10.1145/1143997.1144268. In pro-
REFERENCES
[1280]
[1281]
[1282]
[1283]
[1284]
[1285]
[1286]
[1287]
[1288]
[1289]
[1290]
[1291]
[1292]
703
ceedings [352]. Online available at http://doi.acm.org/10.1145/1143997.1144268
[accessed 2007-08-27].
Xiaodong Li, Jürgen Branke, and Tim Blackwell. Particle swarm with speciation
and adaptation in a dynamic environment. In GECCO’06: Proceedings of the 8th
annual conference on Genetic and evolutionary computation, pages 51–58, 2006.
doi:10.1145/1143997.1144005. In proceedings [352]. Online available at http://doi.
acm.org/10.1145/1143997.1144005 [accessed 2007-08-19].
Suiliong Liang, A. Nur Zincir-Heywood, and Malcom I. Heywood. The effect of routing under local information using a social insect metaphor. In CEC’02: Proceedings of
the Congress on Evolutionary Computation, pages 1438–1443, 2002. IEEE Computer
Society, Washington, DC, USA. In proceedings [703]. Online available at http://
users.cs.dal.ca/~mheywood/X-files/Publications/01004454.pdf [accessed 2008-0726].
Suiliong Liang, A. Nur Zincir-Heywood, and Malcolm I. Heywood. Adding more intelligence to the network routing problem: Antnet and ga-agents. Applied Soft Computing, 6(3):244–257, March 2006. ISSN: 1568-4946. doi:10.1016/j.asoc.2005.01.005.
Pierre Liardet, Pierre Collet, Cyril Fonlupt, Evelyne Lutton, and Marc Schoenauer,
editors. Proceedings of the 6th International Conference on Artificial Evolution,
Evolution Artificielle, EA 2003, volume 2936 of Lecture Notes in Computer Science
(LNCS), October 27–30, 2003, Marseilles, France. Springer Berlin/Heidelberg. ISBN:
3-5402-1523-9. Published in 2003.
Leonid Libkin and Limsoon Wong. Query languages for bags and aggregate functions. Journal of Computer and System Sciences, 55(2):241–272, October 1997. Online available at http://citeseer.ist.psu.edu/libkin97query.html and http://
www.cs.toronto.edu/~libkin/papers/jcss97.ps.gz [accessed 2007-09-12].
Gunar E. Liepins and Michael D. Vose. Deceptiveness and genetic algorithm dynamics. In Proceedings of the First Workshop on Foundations of Genetic Algorithms
(FOGA), pages 36–50, 1991. In proceedings [1924]. Online available at http://www.
osti.gov/bridge/servlets/purl/6445602-CfqU6M/ [accessed 2007-11-05].
Pedro Lima, editor. Robotic Soccer. I-Tech Education and Publishing, Vienna, Austria, December 2007. ISBN: 978-3-90261-321-9. Online available at http://s.
i-techonline.com/Book/Robotic-Soccer/ISBN978-3-902613-21-9.html [accessed
2008-04-23].
Jianhua Lin. Adaptive image quantization based on learning classifier systems. In
DCC’95: Proceedings of the Conference on Data Compression, page 477, March 28–
30, 1995. IEEE Computer Society, Washington, DC, USA.
Shen Lin and Brian Wilson Kernighan. An effective heuristic algorithm for the
traveling-salesman problem. Operations Research, 21(2):498–516, March–April 1973.
Yung-Chien Lin, Kao-Shing Hwang, and Feng-Sheng Wang. Plant scheduling and
planning using mixed-integer hybrid differential evolution with multiplier updating.
In Proceedings of the 2000 Congress on Evolutionary Computation, volume 1, pages
593–600, 2000. In proceedings [1002].
Dennis Victor Lindley and W. F. Scott. New Cambridge Statistical Tables. Cambridge University Press, The Edinburgh Building, Shaftesbury Road, Cambridge,
CB2 8RU, United Kingdom, 1995. ISBN: 0-5214-8485-5, 978-0-52148-485-5. Dewey
number: 519.5/0212. Partly online available at http://books.google.de/books?
id=CN-1fdPIgRsC [accessed 2008-08-18].
Charles X. Ling. Overfitting and generalization in learning discrete patterns. Neurocomputing, 8(3):341–347, August 1995. Optimization and Combinatorics, Part IIII, Online available at http://dx.doi.org/10.1016/0925-2312(95)00050-G and
http://citeseer.ist.psu.edu/514876.html [accessed 2007-09-13].
Daniel A. Liotard. Algorithmic tools in the study of semiempirical potential surfaces. International Journal of Quantum Chemistry, 44(5):723–741, November 5,
704
[1293]
[1294]
[1295]
[1296]
[1297]
[1298]
[1299]
[1300]
[1301]
[1302]
[1303]
[1304]
[1305]
REFERENCES
1992. doi:10.1002/qua.560440505. Online available at http://www3.interscience.
wiley.com/cgi-bin/fulltext/109573913/PDFSTART [accessed 2007-09-15].
Marc Lipsitch. Adaptation on rugged landscapes generated by iterated local interactions of neighboring genes. In ICGA, International Conference on Genetic Algorithms, pages 128–135, 1991. In proceedings [170].
Jun S. Liu. Monte Carlo Strategies in Scientific Computing. Springer, October 2002.
ISBN: 0-3879-5230-6.
Pu Liu, Francis Lau, Michael J. Lewis, and Cho li Wang. A new asynchronous
parallel evolutionary algorithm for function optimization. In Proceedings of the 7th
International Conference on Parallel Problem Solving from Nature, pages 401–410,
2002. In proceedings [867]. Online available at [accessed 2008-04-06].
Yongguo Liu, Kefei Chen, Xiaofeng Liao, and Wei Zhang. A genetic clustering method
for intrusion detection. Pattern Recognition, 37(5):927–942, May 2004. ISSN: 00313203. doi:10.1016/j.patcog.2003.09.011.
Xavier Llorà and Kumara Sastry. Fast rule matching for learning classifier
systems via vector instructions.
In GECCO’06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 1513–1520, 2006.
doi:10.1145/1143997.1144244. In proceedings [352] and also [1298]. Online available
at http://doi.acm.org/10.1145/1143997.1144244 [accessed 2007-09-12].
Xavier Llorà and Kumara Sastry. Fast rule matching for learning classifier systems
via vector instructions. Technical Report 2006001, IlliGAL, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, January 2006. Online available at http://www.illigal.uiuc.edu/pub/papers/IlliGALs/2006001.
pdf [accessed 2007-09-12]. See also [1297].
Fernando G. Lobo, Cláudio F. Lima, and Zbigniew Michalewicz, editors. Parameter
Setting in Evolutionary Algorithms, volume 54 of Studies in Computational Intelligence. Springer-Verlag Gmbh, Berlin, Germany, March 1, 2007. ISBN: 3-5406-9431-5,
978-3-54069-431-1.
José Lobo, John H. Miller, and Walter Fontana.
Neutrality in technological landscapes.
Santa fe working paper, Santa Fe Institute, 1399 Hyde
Park Road, Santa Fe, New Mexico 87501, USA, January 26, 2004. Online
available at http://fontana.med.harvard.edu/www/Documents/WF/Papers/tech.
neut.pdf and http://citeseer.ist.psu.edu/lobo04neutrality.html [accessed 200806-06].
A. Geoff Lockett and Gerd Islei, editors. Proceedings of the 8th International Conference on Multiple Criteria Decision Making: Improving Decision Making in Organizations (MCDM’1988), Lecture Notes in Economics and Mathematical Systems, 1988,
Manchester, UK. Springer. ISBN: 978-0-38751-795-7. Published in December 1989.
Reinhard Lohmann. Structure evolution and incomplete induction. Biological Cybernetics, 69(4):319–326, August 1993. ISSN: 0340-1200 (Print) 1432-0770 (Online). doi:10.1007/BF00203128. Online available at http://www.springerlink.
com/content/q2q668316m771073/fulltext.pdf [accessed 2007-08-12].
Reinhard Lohmann. Structure evolution and neural systems. In Dynamic, Genetic,
and Chaotic Programming: The Sixth-Generation, pages 395–411. Wiley-Interscience,
1992. In collection [1921].
Jason D. Lohn and Silvano P. Colombano. A circuit representation technique for automated circuit design. IEEE Transactions on Evolutionary Computation (IEEE-EC),
3(3):205, September 1999. Online available at http://ic.arc.nasa.gov/people/
jlohn/bio.html and http://citeseer.ist.psu.edu/lohn99circuit.html [accessed
2007-08-07].
Jason D. Lohn, Silvano P. Colombano, Garyl L. Haith, and Dimitris Stassinopoulos.
A parallel genetic algorithm for automated electronic circuit design. In Proceedings
of the Computational Aerosciences Workshop, February 2000, NASA Ames Research
REFERENCES
[1306]
[1307]
[1308]
[1309]
[1310]
[1311]
[1312]
[1313]
[1314]
[1315]
[1316]
705
Center. Online available at http://ic.arc.nasa.gov/people/jlohn/bio.html and
http://citeseer.ist.psu.edu/lohn00parallel.html [accessed 2007-08-07].
Jason D. Lohn, Garyl L. Haith, Silvano P. Colombano, and Dimitris Stassinopoulos.
Towards evolving electronic circuits for autonomous space applications. In Proceedings of the 2000 IEEE Aerospace Conference, March 2000, Big Sky, MT. Online available at http://ic.arc.nasa.gov/people/jlohn/bio.html and http://citeseer.
ist.psu.edu/336276.html [accessed 2007-08-07].
Jason D. Lohn, Gregory S. Hornby, and Derek Linden. An evolved antenna for
deployment on nasa’s space technology 5 mission. In Genetic Programming Theory
and Practice II, 2004. In proceedings [1583]. Online available at http://ic.arc.
nasa.gov/people/hornby/papers/lohn_gptp04.ps.gz [accessed 2007-08-17].
Heitor S. Lopes and Wagner R. Weinert. EGIPSYS: an enhanced gene expression programming approach for symbolic regression problems. International Journal
of Applied Mathematics and Computer Science, 14(3), 2004. Special Issue: Evolutionary Computation. AMCS Centro Federal de Educacao Tecnologica do Parana /
CPGEI Av. 7 de setembro, 3165, 80230-901 Curitiba (PR), Brazil. Online available
at http://matwbn.icm.edu.pl/ksiazki/amc/amc14/amc1437.pdf [accessed 2007-08-23].
Ines Fernando Vega Lopez, Richard T. Snodgrass, and Bongki Moon. Spatiotemporal aggregate computation: A survey. IEEE Transactions on Knowledge and Data Engineering, 17(2):271–286, February 2005.
ISSN: 10414347. Online available at http://citeseer.ist.psu.edu/634034.html [accessed
http://www.cs.arizona.edu/ bkmoon/papers/tkde-stagg.pdf]2007-09-12.
Richard Lowry. Concepts and Applications of Inferential Statistics. Vassar College,
124 Raymond Avenue, Poughkeepsie, New York 12604, USA, 2006. Companion site of
[1313]. Online available at http://faculty.vassar.edu/lowry/webtext.html and
http://dogsbody.psych.mun.ca/VassarStats/webtext.html [accessed 2008-12-08].
Richard Lowry. Vassarstats 2x2 contingency table tests. In VassarStats: Web Site
for Statistical Computing, chapter 8 in [1310]. Vassar College, March 30, 2006. In
collection [1313]. Online available at http://faculty.vassar.edu/lowry/tab2x2.
html and http://dogsbody.psych.mun.ca/VassarStats/tab2x2.html [accessed 200812-08].
Richard Lowry. Vassarstats mann-whitney test. In VassarStats: Web Site for Statistical Computing, chapter 11a in [1310]. Vassar College, September 22, 2006. In
collection [1313]. Online available at http://faculty.vassar.edu/lowry/utest.
html and http://dogsbody.psych.mun.ca/VassarStats/utest.html [accessed 2008-1207].
Richard Lowry. VassarStats: Web Site for Statistical Computing. Vassar College, 124
Raymond Avenue, Poughkeepsie, New York 12604, USA, 2006. See also [1310]. Online
available at http://faculty.vassar.edu/lowry/VassarStats.html and http://
dogsbody.psych.mun.ca/VassarStats/ [accessed 2008-12-08].
METEOR-S: Semantic Web Services and Processes. LSDIS Lab (Large Scale Distributed Information Systems), Department of Computer Science, University of Georgia, 2004. Online available at http://lsdis.cs.uga.edu/projects/meteor-s/ [accessed 2007-09-02].
Haiming Lu. State-of-the-art Multiobjective Evolutionary Algorithms – Pareto Ranking, Density Estimation and Dynamic Population. PhD thesis, Faculty of the
Graduate College of the Oklahoma State University, Stillwater, Oklahoma, August
2002. Advisor: Gary G. Yen. Publication Number AAT 3080536. Online available at
http://www.lania.mx/~ccoello/EMOO/thesis_lu.pdf.gz [accessed 2007-08-25].
Wei Lu and Issa Traore. Detecting new forms of network intrusions using genetic programming. Computational Intelligence, 20(3):475–494, August 2004. Online available
at http://www.isot.ece.uvic.ca/publications/journals/coi-2004.pdf [accessed
2008-06-11].
706
REFERENCES
[1317] Sean Luke. Evolving soccerbots: A retrospective. In Proceedings of the 12th Annual
Conference of the Japanese Society for Artificial Intelligence (JSAI), 1998. Online
available at http://cs.gmu.edu/~sean/papers/robocupShort.pdf and http://
citeseer.ist.psu.edu/43338.html [accessed 2007-09-09]. See also [1324, 1325].
[1318] Sean Luke. Code growth is not caused by introns. In Late Breaking Papers at
the 2000 Genetic and Evolutionary Computation Conference, pages 228–235, 2000.
In proceedings [2210]. Online available at http://citeseer.ist.psu.edu/300709.
html and http://www.cs.gmu.edu/~sean/papers/intronpaper.pdf [accessed 2007-0907].
[1319] Sean Luke and Liviu Panait. A survey and comparison of tree generation algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 81–88, 2001. In proceedings [1937]. Online available
at http://citeseer.ist.psu.edu/luke01survey.html and http://www.cs.gmu.
edu/~sean/papers/treegenalgs.pdf [accessed 2007-07-28].
[1320] Sean Luke and Liviu Panait. A comparison of bloat control methods for genetic
programming. Evolutionary Computation, 14(3):309–344, 2006. ISSN: 1063-6560.
[1321] Sean Luke and Lee Spector. Evolving graphs and networks with edge encoding: A
preliminary report. In Late Breaking Papers at the First Annual Conference Genetic
Programming (GP-96), 1996. In proceedings [1197]. Online available at http://
citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.9484 and http://cs.
gmu.edu/~sean/papers/graph-paper.pdf [accessed 2008-08-02].
[1322] Sean Luke and Lee Spector. A comparison of crossover and mutation in genetic programming. In Genetic Programming 1997: Proceedings of the Second
Annual Conference, pages 240–248, 1997. In proceedings [1208]. Online available at http://citeseer.ist.psu.edu/146629.html and http://hampshire.edu/
lspector/pubs/comparison.pdf [accessed 2008-04-12].
[1323] Sean Luke and Lee Spector. Evolving teamwork and coordination with genetic programming. In Genetic Programming 1996: Proceedings of the First Annual Conference, pages 150–156, 1996. In proceedings [1207]. Online available at
http://citeseer.ist.psu.edu/luke96evolving.html and http://www.ifi.uzh.
ch/groups/ailab/people/nitschke/refs/Cooperation/cooperation.pdf [accessed
2008-07-28].
[1324] Sean Luke, Charles Hohn, Jonathan Farris, Gary Jackson, and James Hendler. Coevolving soccer softbot team coordination with genetic programming. In Proceedings
of the First International Workshop on RoboCup, at the International Joint Conference on Artificial Intelligence, 1997. Online available at http://citeseer.ist.psu.
edu/3898.html and http://www.cs.umd.edu/~seanl/papers/robocup.pdf [accessed
2007-09-09]. In proceedings [1455, 1456]. See also [1325].
[1325] Sean Luke, Charles Hohn, Jonathan Farris, Gary Jackson, and James Hendler. Coevolving soccer softbot team coordination with genetic programming. In Hiroaki
Kitano, editor, RoboCup-97: Robot Soccer World Cup I, number 1395 in Lecture
Notes in Computer Science (LNCS), subseries Lecture Notes in Artificial Intelligence (LNAI). Springer Berlin/Heidelberg, 1998. ISBN: 978-3-54064-473-6. Online
available at hhttp://www.cs.umd.edu/~seanl/papers/robocupc.pdf [accessed 2007-0909]. See also [1324].
[1326] Sean Luke, Conor Ryan, and Una-May O’Reilly, editors. GECCO 2002: Graduate
Student Workshop, July 9, 2002, New York. AAAI, 445 Burgess Drive, Menlo Park,
CA 94025. Part of [154].
[1327] Sean Luke, Liviu Panait, Gabriel Balan, Sean Paus, Zbigniew Skolicki, Jeff Bassett,
Robert Hubley, and Alexander Chircop. Ecj: A java-based evolutionary computation research system, 2006. In 2007, ECJ reached version 16. For more information
http://cs.gmu.edu/~eclab/projects/ecj/ [accessed 2007-07-10].
REFERENCES
707
[1328] Eduard Lukschandl, Magnus Holmlund, Eric Moden, Mats Nordahl, and Peter
Nordin. Induction of Java bytecode with genetic programming. In Late Breaking
Papers at the Genetic Programming 1998 Conference, pages 135–142, 1998. In proceedings [1198].
[1329] Eduard Lukschandl, Henrik Borgvall, Lars Nohle, Mats G. Nordahl, and
Peter Nordin.
Evolving routing algorithms with the jbgp-system.
In
EvoIASP’99/EuroEcTel’99: Proceedings of the First European Workshops on Evolutionary Image Analysis, Signal Processing and Telecommunications, pages 193–202,
1999. doi:10.1007/10704703 16. In proceedings [1665].
[1330] Eduard Lukschandl, Henrik Borgvall, Lars Nohle, Mats G. Nordahl, and Peter
Nordin. Distributed java bytecode genetic programming with telecom applications. In
European Conference on Genetic Programming, EuroGP, 2000. doi:10.1007/b75085.
In proceedings [1666].
[1331] Eduard Lukschandl, Peter Nordin, and Mats G. Nordahl. Using the java method
evolver for load balancing in communication networks. In Late Breaking Papers at
the 2000 Genetic and Evolutionary Computation Conference, pages 236–239, 2000.
In proceedings [2210].
[1332] Changtong Luo. Low dimensional simplex evolution algorithms and their applications.
PhD thesis, Jilin University, 2007. in Chinese.
[1333] Changtong Luo and Bo Yu. Low dimensional simplex evolution – a hybrid heuristic for global optimization. In SNPD 2007: Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, volume 2, pages 470–474, July 30–August 1, 2007, Qingdao,
Shandong, China. ISBN: 978-0-76952-909-7. INSPEC Accession Number: 9873104.
doi:10.1109/SNPD.2007.58.
[1334] Mikulas Luptacik and Rudolf Vetschera, editors. Proceedings of the First MCDM
Winter Conference, 16th International Conference on Multiple Criteria Decision
Making (MCDM’2002), February 12–22, 2002, Hotel Panhans, Semmering, Austria.
See http://orgwww.bwl.univie.ac.at/mcdm2002 [accessed 2007-09-10].
[1335] Jay L. Lush. Progeny test and individual performance as indicators of an animal’s
breeding value. Journal of Dairy Science, 18(1):1–19, January 1935. Online available
at http://jds.fass.org/cgi/reprint/18/1/1 [accessed 2007-11-27].
[1336] Evelyne Lutton, Pierre Collet, and Jean Louchet. Easea comparisons on test functions: Galib versus eo. In Proceedings of the Fifth Conference on Artificial Evolution,
Evolution Artificielle (EA-2001), pages 219–230, 2001. In proceedings [428]. Online
available at http://fractales.inria.fr/evo-lab/EASEAComparisonFinal.ps.gz
[accessed 2007-08-24].
M
[1337] Shingo Mabu, Kotaro Hirasawa, and Jinglu Hu. Genetic network programming with
reinforcement learning and its performance evaluation. In Late Breaking Papers at
the 2004 Genetic and Evolutionary Computation Conference, 2004. In proceedings
[1113]. Online available at http://www.cs.bham.ac.uk/~wbl/biblio/gecco2004/
LBP036.pdf [accessed 2008-06-16].
[1338] Penousal Machado, Jorge Tavares, Francisco B. Pereira, and Ernesto Jorge Fernandes Costa. Vehicle routing problem: Doing it the evolutionary way. In GECCO
2002: Proceedings of the Genetic and Evolutionary Computation Conference, page
690, 2002. In proceedings [1245]. Online available at http://citeseerx.ist.psu.
edu/viewdoc/summary?doi=10.1.1.16.8208 and http://osiris.tuwien.ac.at/
~wgarn/VehicleRouting/GECCO02_VRPCoEvo.pdf [accessed 2008-10-27].
[1339] P. K. Mackeown. Stochastic Simulation in Physics. Springer-Verlag New York, Inc.,
Secaucus, NJ, USA, 2001. ISBN: 9-8130-8326-3.
708
REFERENCES
[1340] Kenneth J. Mackin and Eiichiro Tazaki. Emergent agent communication in multiagent systems using automatically defined function genetic programming (adf-gp). In
Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics,
IEEE SMC’99, volume 5, pages 138–142, October 12–15, 1999, Tokyo, Japan. ISBN:
0-7803-5731-0, 978-0-78035-731-0. doi:10.1109/ICSMC.1999.815536.
[1341] Kenneth J. Mackin and Eiichiro Tazaki. Unsupervised training of multiobjective agent communication using genetic programming. In KES, pages 738–741,
2000. doi:10.1109/KES.2000.884152. In proceedings [963]. Online available at
http://www.cs.bham.ac.uk/~wbl/biblio/gp-html/Mackin00.html and http://
www.lania.mx/~ccoello/EMOO/mackin00.pdf.gz [accessed 2008-07-28].
[1342] Kenneth J. Mackin and Eiichiro Tazaki. Multiagent communication combining genetic programming and pheromone communication. Kybernetes, 31(6):827–843, 2002.
doi:10.1108/03684920210432808. Online available at http://www.emeraldinsight.
com/10.1108/03684920210432808 [accessed 2008-07-28].
[1343] J. B. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and
Probability, volume 1, pages 281–297. Berkeley, University of California Press, 1967.
[1344] Ole Lehrmann Madsen. On defining semantics by means of extended attribute grammars. In Semantics-Directed Compiler Generation, Proceedings of a Workshop, volume 94 of Lecture Notes In Computer Science (LNCS), pages 259–299, January 14–18,
1980, Aarhus, Denmark. Springer-Verlag, London, UK. ISBN: 3-5401-0250-7.
[1345] Alexander Maedche, Steffen Staab, Claire Nedellec, and Eduard H. Hovy, editors. IJCAI’2001 Workshop on Ontology Learning, Proceedings of the Second
Workshop on Ontology Learning OL’2001, volume 38 of CEUR Workshop Proceedings, August 4, 2001, Seattle, Washington, USA. CEUR-WS.org. Online available at http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/
Vol-47/ [accessed 2008-04-01]. See also [1507]. Held in conjunction with the 17th International Conference on Artificial Intelligence IJCAI’2001.
[1346] Pattie Maes, Maja J. Mataric, Jean-Arcady Meyer, Jordan B. Pollack, and Stewart W. Wilson, editors. Proceedings of the Fourth International Conference on Simulation of Adaptive Behavior: From animals to animats 4, September 9-13, 1996, Cape
Code, USA. MIT Press, Cambridge, MA, USA. ISBN: 0-2626-3178-4.
[1347] Anne E. Magurran. Ecological Diversity and Its Measurement. Princeton University
Press, 41 William Street, Princeton, New Jersey 08540, USA, November 1988. ISBN:
978-0-69108-491-6, 0-6910-8485-8, 0-6910-8491-2.
[1348] Anne E. Magurran. Biological diversity. Current Biology Magazine, 15(4):R116–
R118, February 22, 2005. doi:10.1016/j.cub.2005.02.006. Online available at http://
dx.doi.org/10.1016/j.cub.2005.02.006 [accessed 2008-11-10].
[1349] A. Malhotra, J. H. Oliver, and W. Tu. Synthesis of spatially and intrinsically constrained curves using simulated annealing. ASME Transactions, Journal of Mechanical Design, 118:53–61, March 1996. DE-vol. 32-1 Alliances in Design Automation,
vol. 1 ASME 1991 pp. 145–155.
[1350] Masud Ahmad Malik. Evolution of the high level programming languages: a critical
perspective. ACM SIGPLAN Notices, 33(12):72–80, December 1998. ISSN: 03621340. Online available at http://doi.acm.org/10.1145/307824.307882 [accessed 200709-14].
[1351] David Malkin. The Evolutionary Impact of Gradual Complexification on Complex
Systems. PhD thesis, University College London (UCL), Computer Science, 2008.
[1352] Bernard Manderick and Frans Moyson. The collective behaviour of ants: an example
of self-organization in massive parallelism. In Proceedings of AAAI Spring Symposium
on Parallel Models of Intelligence, 1988, Stanford, California.
REFERENCES
709
[1353] Bernard Manderick and Piet Spiessens. Fine-grained parallel genetic algorithms. In
Proceedings of the third international conference on Genetic algorithms, pages 428–
433, 1989. In proceedings [1820].
[1354] Bernard Manderick, Mark de Weger, and Piet Spiessens. The genetic algorithm
and the structure of the fitness landscape. In Proceedings of the 4th International
Conference on Genetic Algorithms, pages 143–150, 1991. In proceedings [170].
[1355] Vittorio Maniezzo, Luca Maria Gambardella, and Fabio de Luigi. Ant colony optimization. In New Optimization Techniques in Engineering, chapter 5, pages 101–117.
Springer-Verlag, 2004. In collection [1580]. Online available at http://www.idsia.
ch/~luca/aco2004.pdf and http://citeseer.ist.psu.edu/maniezzo04ant.html
[accessed 2007-09-13].
[1356] Henry B. Mann and Donald R. Whitney. On a test of whether one of two random
variables is stochastically larger than the other. The Annals of Mathematical Statistics, 18(1):50–60, March 1947. doi:10.1214/aoms/1177730491. Mathematical Reviews
number (MathSciNet): MR22058, Zentralblatt MATH identifier: 0041.26103. Online
available at http://projecteuclid.org/euclid.aoms/1177730491 [accessed 2008-10-24].
[1357] Reinhard Männer and Bernard Manderick, editors. Proceedings of Parallel Problem
Solving from Nature 2, PPSN II, September 28–30, 1992, Brussels, Belgium. Elsevier.
See http://ls11-www.informatik.uni-dortmund.de/PPSN/ppsn2/ppsn2.html [accessed 2007-09-05].
[1358] Steven Manos, Leon Poladian, Peter J. Bentley, and Maryanne Large. A genetic algorithm with a variable-length genotype and embryogeny for microstructured optical
fibre design. In GECCO’06: Proceedings of the 8th annual conference on Genetic
and evolutionary computation, pages 1721–1728, 2006. In proceedings [352]. Online
available at http://portal.acm.org/citation.cfm?id=1144278 [accessed 2007-08-17].
[1359] Subbarao Kambhampati Manuela M. Veloso, editor. Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI) and the Seventeenth Innovative
Applications of Artificial Intelligence Conference (IAA), July 9–13, 2005, Pittsburgh,
Pennsylvania, USA. AAAI Press/The MIT Press. ISBN: 1-5773-5236-X. See http://
www.aaai.org/Conferences/AAAI/aaai05.php [accessed 2007-09-06] and http://www.
aaai.org/Conferences/IAAI/iaai06.php [accessed 2007-09-06].
[1360] Elena Marchiori and Adri G. Steenbeek. An evolutionary algorithm for large scale
set covering problems with application to airline crew scheduling. In Proceedings
of Real-World Applications of Evolutionary Computing, EvoWorkshops 2000, pages
367–381, 2000. In proceedings [320]. Online available at http://citeseer.ist.psu.
edu/marchiori00evolutionary.html [accessed 2007-08-27].
[1361] M. H. Marghny and I. E. El-Semman. Extracting fuzzy classification rules with
gene expression programming. ICGST International Journal on Artificial Intelligence
and Machine Learning, AIML, (Special Issue on AI & Specific Applications), 2006.
AIML 05 Conference, 19-21 December 2005, CICC, Cairo, Egypt. Online available
at http://www.icgst.com/AIML05/papers/P1120535114.pdf [accessed 2007-08-23].
[1362] Eric A. Marks and Michael Bell. Executive’s Guide to Service oriented architecture
(SOA): A Planning and Implementation Guide for Business and Technology. John
Wiley & Sons, Inc., Hoboken, NJ, April 2006. ISBN: 978-0-47003-614-3.
[1363] Max Martin, Eric Drucker, and Walter Don Potter. Ga, eo, and pso applied to
the discrete network configuration problem. In International Conference on Genetic and Evolutionary Methods, GEM’08, 2008. In proceedings [81]. Online available at http://www.cs.uga.edu/~potter/CompIntell/GEM_Martin-et-al.pdf [accessed 2008-08-23].
[1364] Trevor P. Martin and Anca L. Ralescu, editors. Fuzzy Logic in Artificial Intelligence,
Towards Intelligent Systems, IJCAI’95 Selected Papers from Workshop, volume 1188
of Lecture Notes in Computer Science (LNCS), 1997, Montréal, Québec, Canada.
Springer. ISBN: 3-5406-2474-0. See also [1453, 1454, 2190].
710
REFERENCES
[1365] Worthy Neil Martin, Jens Lienig, and James P. Cohoon. Island (migration) models:
Evolutionary algorithms based on punctuated equilibria. In Handbook of Evolutionary
Computation, chapter 6.3. Oxford University Press, 1997. In collection [104]. Online
available at http://www.cs.virginia.edu/papers/Island_Migration.pdf [accessed
2007-08-13].
[1366] H. Martinez-Alfaro and D. R. Flugrad. Collision-free path planning for mobile robots
and/or agvs using simulated annealing. In Systems, Man, and Cybernetics 1994. Proceedings of the IEEE International Conference on Humans, Information and Technology, volume 1, pages 270–275. IEEE, October 1994. doi:10.1109/ICSMC.1994.399849.
[1367] H. Martinez-Alfaro, H. Valdez, and J. Ortega. Linkage synthesis of a four bar mechanism for n precision points using simulated annealing. In Proceedings of the 1998
ASME Design Engineering Technical Conference, page 7, September 13–16, 1998,
Atlanta, USA.
[1368] Horacio Martı́nez-Alfaro and Manuel Valenzuela-Rendón. Using simulated annealing
for paper cutting optimization. In MICAI 2004: Advances in Artificial Intelligence,
pages 11–20, 2004. In proceedings [1442].
[1369] Yoshiyuki Matsumura, Kazuhiro Ohkura, and Kanji Ueda. Advantages of global
discrete recombination in (µ/µ, λ)-evolution strategies. In Proceedings of the 2002
Congress on Evolutionary Computation CEC2002, volume 2, pages 1848–1853, 2002.
doi:10.1109/CEC.2002.1004524. In proceedings [703].
[1370] Friedemann Mattern.
Verteilte Basisalgorithmen, volume 226 of InformatikFachberichte (IFB). W. Bauer im Auftrag der Gesellschaft für Informatik (GI),
Springer-Verlag GmbH, Berlin/Heidelberg, Germany, 1989. ISBN: 3-5405-1835-5,
0-3875-1835-5, 978-3-54051-835-8, 978-0-38751-835-0. LCCN: 90140009. Based on
his dissertation at Prof. Dr. J. Nehmer’s group / Sonderforschungsbereich “VLSIEntwurf und Parallelität” at the computer science department of the University of
Kaiserslautern.
[1371] J. Matyas. Random optimization. Automation and Remote Control, 26(2):244–251,
1965.
[1372] J. Matyas. Das zufällige optimierungsverfahren und seine konvergenz. In Proceedings of the 5th International Analogue Computation Meeting, pages 540–544. Presses
Academiques Europeens, Brussels, 1968, Lausanne.
[1373] Ueli Maurer. Fast generation of prime numbers and secure public-key cryptographic
parameters. Journal of Cryptology, 8(3):123–155, September 1995. ISSN: 0933-2790
(Print) 1432-1378 (Online). doi:10.1007/BF00202269. Online available at http://
www.springerlink.com/content/u3710818146qq153/fulltext.pdf and http://
citeseer.ist.psu.edu/186041.html [accessed 2007-09-15].
[1374] Giles Mayley. Guiding or hiding: explorations into the effects of learning on the rate
of evolution. In Fourth European Conference on Artificial Life, ECAL’97, pages 135–
144, 1997. In proceedings [975]. Online available at http://citeseerx.ist.psu.
edu/viewdoc/summary?doi=10.1.1.50.9241 [accessed 2008-09-10].
[1375] Ernst Mayr. The Growth of Biological Thought. Harvard University Press, 1982,
Cambridge, MA, USA. ISBN: 0-6743-6446-5.
[1376] A. D. McAulay and Jae C. Oh. Image learning classifier system using genetic algorithms. In Proceedings of IEEE National Aerospace Electronics Conference NAECON’89, volume 2, pages 705–710, May 22–26, 1989. an IEEE conference.
[1377] John L. McCarthy. Recursive functions of symbolic expressions and their computation
by machine, part i. Communications of the ACM, 3(4):184–195, April 1960. ISSN:
0001-0782. Online available at http://doi.acm.org/10.1145/367177.367199 and
http://citeseer.ist.psu.edu/mccarthy60recursive.html [accessed 2007-09-15].
[1378] John L. McCarthy. History of lisp. In Richard L. Wexelblat, editor, History of Programming Languages: Proceedings of the ACM SIGPLAN Conference, pages 173–197.
Academic Press, June 1978. Online available at http://citeseer.ist.psu.edu/
REFERENCES
[1379]
[1380]
[1381]
[1382]
[1383]
[1384]
[1385]
[1386]
[1387]
[1388]
[1389]
711
mccarthy78history.html [accessed 2007-09-15]. See also http://www-formal.stanford.
edu/jmc/history/lisp/lisp.html [accessed 2007-09-15].
John L. McCarthy, Paul W. Abrahams, Daniel J. Edwards, Timothy P. Hari, and
Michael L. Levin. LISP 1.5 Programmer’s Manual. The MIT Press, August 1962.
ISBN: 978-0-26213-011-0, 0-2621-3011-4. Second Edition, 15th Printing, Online available at http://www.softwarepreservation.org/projects/LISP/book/LISP%201.
5%20Programmers%20Manual.pdf [accessed 2007-09-15]. See also [1379].
John Robert McDonnell, Robert G. Reynolds, and David B. Fogel, editors. Proceedings of the 4th Annual Conference on Evolutionary Programming, A Bradford Book,
Complex Adaptive Systems, March 1995, San Diego, CA, USA. The MIT Press,
Cambridge, Massachusetts. ISBN: 0-2621-3317-2.
Deborah L. McGuinness and George Ferguson, editors. Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI) and the Sixteenth
Conference on Innovative Applications of Artificial Intelligence (IAAI), July 25–
29, 2004, San Jose, California, USA. AAAI Press/The MIT Press.
ISBN:
0-2625-1183-5. See http://www.aaai.org/Conferences/AAAI/aaai04.php [accessed
2007-09-06] and http://www.aaai.org/Conferences/IAAI/iaai04.php [accessed 2007-0906].
Robert Ian McKay, Xuan Hoai Nguyen, Peter Alexander Whigham, and Yin Shan.
Grammars in genetic programming: A brief review. In L. Kang, Z. Cai, and Y. Yan,
editors, Progress in Intelligence Computation and Intelligence: Proceedings of the
International Symposium on Intelligence, Computation and Applications, pages 3–
18. China University of Geosciences Press, April 2005. Online available at http://
sc.snu.ac.kr/PAPERS/isica05.pdf [accessed 2007-08-15].
K. I. M. McKinnon. Convergence of the Nelder-Mead simplex method to a nonstationary point. SIAM Journal on Optimization, 9(1):148–158, 1999. ISSN: 1052-6234
(print) / 1095-7189 (electronic).
Nicholas Freitag McPhee and Justin Darwin Miller. Accurate replication in genetic programming. In Genetic Algorithms: Proceedings of the Sixth International
Conference (ICGA95), pages 303–309, 1995. In proceedings [636]. Online available at http://www.mrs.umn.edu/~mcphee/Research/Accurate_replication.ps
and http://citeseer.ist.psu.edu/mcphee95accurate.html [accessed 2007-09-07].
Nicholas Freitag McPhee and Ricardo Poli. Memory with memory: Soft assignment in
genetic programming. In Proceedings of the Genetic and Evolutionary Computation
Conference, pages 1235–1242, 2008. In proceedings [1117].
Michael Meissner, Michael Schmuker, and Gisbert Schneider. Optimized particle
swarm optimization (opso) and its application to artificial neural network training.
BMC Bioinformatics, 7(125), 2006. doi:10.1186/1471-2105-7-125. Online available at
http://www.biomedcentral.com/1471-2105/7/125 [accessed 2007-08-21].
Tommaso Melodia, Dario Pompili, and Ian F. Akyildiz. On the interdependence
of distributed topology control and geographical routing in ad hoc and sensor networks. Journal of Selected Areas in Communications, 23(3):520–532, March 2005.
doi:10.1109/JSAC.2004.842557.
Jerry M. Mendel, Takashi Omari, and Xin Yao, editors. The First IEEE Symposium
on Foundations of Computational Intelligence (FOCI’07), April 1–5, 2007, Hilton
Hawaiian Village Beach Resort & Spa, Honolulu, Hawaii, USA. Institute of Electrical and Electronics Engineers (IEEE), Piscataway, N.J., USA. ISBN: 1-4244-0703-6,
978-1-42440-703-3. IEEE catalog number: 07EX1569. Sponsored by IEEE Computational Intelligence Society.
Roberto R. F. Mendes, Fabricio de B. Voznika, Alex A. Freitas, and Julio C. Nievola.
Discovering fuzzy classification rules with genetic programming and co-evolution.
In Luc de Raedt and Arno Siebes, editors, Proceedings of 5th European Conference
on Principles and Practice of Knowledge Discovery in Databases (PKDD’01), vol-
712
[1390]
[1391]
[1392]
[1393]
[1394]
[1395]
[1396]
[1397]
[1398]
[1399]
REFERENCES
ume 2168 of Lecture Notes in Computer Science (LNCS), subseries Lecture Nots
in Artificial Intelligence (LNAI), pages 314–325. Springer Verlag Berlin/Heidelberg,
September 3–5, 2001, Freiburg, Germany. ISBN: 978-3-54042-534-2. See also [1390].
Online available at http://www.cs.kent.ac.uk/people/staff/aaf/pub_papers.
dir/PKDD-2001.ps [accessed 2007-09-09].
Roberto R. F. Mendes, Fabricio de B. Voznika, Alex A. Freitas, and Julio C. Nievola.
Discovering fuzzy classification rules with genetic programming and co-evolution.
In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2001), 2001. In proceedings [1937] and [1389]. Online available at http://citeseer.
ist.psu.edu/521000.html [accessed 2007-09-09].
Rui Mendes and Arvind S. Mohais. Dynde: a differential evolution for dynamic
optimization problems. In Proceedings of 2005 IEEE Congress on Evolutionary
Computation, volume 3, pages 2808–2815, 2005. In proceedings [449]. Online available at http://www.di.uminho.pt/~rcm/publications/DynDE.pdf and http://
en.scientificcommons.org/8412355 [accessed 2007-08-13].
Daniel Merkle, Martin Middendorf, and Hartmut Schmeck.
Ant colony optimization for resource-constrained project scheduling.
In Proceedings of the
Genetic and Evolutionary Computation Conference (GECCO-2000), pages 893–
900, 2000. In proceedings [2216]. Online available at http://citeseer.ist.
psu.edu/merkle00ant.html and http://pacosy.informatik.uni-leipzig.de/
pv/Personen/middendorf/Papers/ [accessed 2007-08-19].
Laurence D. Merkle and Frank Moore, editors. Defense Applications of Computational Intelligence (DACI) Workshop 2008, July 12, 2008, Renaissance Atlanta Hotel
Downtown, 590 West Peachtree Street NW, Atlanta, Georgia 30308 USA. ACM Press,
New York, NY, USA. ISBN: 978-1-60558-131-6. Part of GECCO 2008, see also [1117].
Marjan Mernik, Goran Gerlič, Viljem Žumer, and Barrett R. Bryant. Can a parser
be generated from examples? In SAC’03: Proceedings of the 2003 ACM symposium
on Applied computing, pages 1063–1067, 2003, Melbourne, Florida. ACM Press, New
York, NY, USA. ISBN: 1-5811-3624-2. doi:10.1145/952532.952740. Online available at http://www.cis.uab.edu/softcom/GenParse/sac.pdf and http://doi.
acm.org/10.1145/952532.952740 [accessed 2007-09-09].
Peter Merz and Bernd Freisleben. A comparison of memetic algorithms, tabu search,
and ant colonies for the quadratic assignment problem. In Proceedings of the Congress
on Evolutionary Computation, volume 3, pages 2063–2070, 1999. In proceedings
[69], Online available at http://en.scientificcommons.org/204950 and http://
citeseer.ist.psu.edu/merz99comparison.html [accessed 2008-03-28].
Nicholas Metropolis, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H.
Teller, and Edward Teller.
Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6):1087–1092, June 1953.
doi:10.1063/1.1699114. Online available at http://link.aip.org/link/?JCPSA6/
21/1087/1 [accessed 2008-03-26].
Jean-Arcady Meyer and Stewart W. Wilson, editors. From Animals to Animats: Proceedings of the First International Conference on Simulation of Adaptive Behavior,
September 24–28, 1990, Paris, France. The MIT Press, Cambridge, MA, USA. ISBN:
0-2626-3138-5. Published in 1991.
Jean-Arcady Meyer, A. Berthoz, D. Floreano, H. Roitblat, and Stewart W. Wilson,
editors. SAB2000: From Animals to Animats 6, Proceedings of the 6th International
Conference on Simulation of Adpative Behavior, August 2000, Paris, France. MIT
Press, Cambridge, MA, USA. ISBN: 0-2626-3200-4.
Thomas Meyer, Daniel Schreckling, Christian Tschudin, and Lidia Yamamoto. Robustness to code and data deletion in autocatalytic quines. In Corrado Priami, Falko
Dressler, Ozgur B. Akan, and Alioune Ngom, editors, Transactions on Computational Systems Biology X, volume 10/1974 of Lecture Notes in Computer Science
REFERENCES
[1400]
[1401]
[1402]
[1403]
[1404]
[1405]
[1406]
[1407]
[1408]
[1409]
713
(LNCS), Subseries SL 8 – Lecture Notes in Bioinformatics, chapter 2, pages 20–
40. Springer Berlin / Heidelberg, 2008. ISBN: 3-5409-2272-5, 978-3-54092-272-8.
doi:10.1007/978-3-540-92273-5 2. Online available at http://cn.cs.unibas.ch/
people/tm/doc/2008-tcsb.pdf [accessed 2008-11-09]. accepted for publication.
Silja Meyer-Nieberg and Hans-Georg Beyer. Self-adaptation in evolutionary algorithms. In Parameter Setting in Evolutionary Algorithms. Springer, 2007. In collection [1299]. Online available at http://citeseer.ist.psu.edu/741946.html [accessed
2007-07-28].
Juan C. Meza and M. L. Martinez. On the use of direct search methods for the
molecular conformation problem. Journal of Computational Chemistry, 15(6):627–
632, 1994. Online available at http://crd.lbl.gov/~meza/papers/jcc.pdf [accessed
2008-06-14].
M. Mezard, Giorgio Parisi, and M. A. Virasoro. Spin Glass Theory and Beyond
– An Introduction to the Replica Method and Its Applications, volume 9 of World
Scientific Lecture Notes in Physics. World Scientific Publishing Company, November
1987. ISBN: 978-9-97150-115-0, 9-9715-0115-5, 978-9-97150-116-7, 9-9715-0116-3.
Efrén Mezura-Montes and Carlos Artemio Coello Coello. Using the evolution strategies’ self-adaptation mechanism and tournament selection for global optimization.
Intelligent Engineering Systems through Artificial Neural Networks (ANNIE’2003),
13:373–378, November 2003. Theoretical Developments in Computational Intelligence Award, 1st runner up. Online available at http://www.lania.mx/~emezura/
documentos/annie03.pdf [accessed 2008-03-20].
Efrén Mezura-Montes, Jesús Velázquez-Reyes, and Carlos Artemio Coello Coello.
A comparative study of differential evolution variants for global optimization. In
GECCO’06: Proceedings of the 8th annual conference on Genetic and evolutionary
computation, pages 485–492, 2006. doi:10.1145/1143997.1144086. In proceedings
[352]. Online available at http://portal.acm.org/citation.cfm?id=1144086 and
http://delta.cs.cinvestav.mx/~ccoello/2006.html [accessed 2007-08-13].
Zbigniew Michalewicz. A step towards optimal topology of communication networks.
In Vibeke Libby, editor, Proceedings of Data Structures and Target Classification, the
SPIE’s International Symposium on Optical Engineering and Photonics in Aerospace
Sensing, volume 1470 of SPIE, pages 112–122. SPIE – The International Society
for Optical Engineering., April 1–5 1991, Orlando, Florida. ISBN: 0-8194-0579-5,
978-0-81940-579-1.
Zbigniew Michalewicz. Genetic algorithms, numerical optimization, and constraints. In Proceedings of the Sixth International Conference on Genetic Algorithms,
pages 151–158., 1995. In proceedings [636]. Online available at http://www.cs.
adelaide.edu.au/~zbyszek/Papers/p16.pdf and http://citeseerx.ist.psu.
edu/viewdoc/summary?doi=10.1.1.14.1880 [accessed 2009-02-28].
Zbigniew Michalewicz and David B. Fogel. How to Solve It: Modern Heuristics. Springer, second, revised and extended edition, December 2004. ISBN:
978-3-54022-494-5.
Zbigniew Michalewicz and Girish Nazhiyath. Genocop iii: A co-evolutionary algorithm for numerical optimization with nonlinear constraints. In Proceedings of
the Second IEEE International Conference on Evolutionary Computation, volume 2,
pages 647–651, 1995. doi:10.1109/ICEC.1995.487460. In proceedings [1000]. Online available at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.
14.2923 and http://www.cs.cinvestav.mx/~constraint/papers/p24.ps [accessed
2009-02-28].
Zbigniew Michalewicz and Robert G. Reynolds, editors. Proceedings of the IEEE
Congress on Evolutionary Computation, CEC 2008, June1–6, 2007, Hong Kong Convention and Exhibition Centre, Hong Kong, China. IEEE Press, 445 Hoes Lane, P.O.
714
[1410]
[1411]
[1412]
[1413]
[1414]
[1415]
[1416]
[1417]
[1418]
[1419]
REFERENCES
Box 1331, Piscataway, NJ 08855-1331, USA. ISBN: 978-1-42441-823-7. See http://
www.wcci2008.org/ [accessed 2008-07-24].
Zbigniew Michalewicz and Marc Schoenauer. Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation, 4(1):1–32,
Spring 1996. ISSN: 1063-6560, 1530-9304. doi:10.1162/evco.1996.4.1.1. Online available at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.9279
and http://www.cs.adelaide.edu.au/~zbyszek/Papers/p30.pdf [accessed 2009-02-28].
Zbigniew Michalewicz, J. David Schaffer, Hans-Paul Schwefel, David B. Fogel, and
Hiroaki Kitano, editors. Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, June 27–
29, 1994, Orlando, Florida, USA. IEEE Press, Piscataway, New Jersey. ISBN:
0-7803-1899-4. INSPEC Accession Number: 4812337. See http://ieeexplore.ieee.
org/servlet/opac?punumber=1125 [accessed 2007-09-06].
Kaisa Miettinen, Marko M. Mäkelä, Pekka Neittaanmäki, and Jacques Periaux, editors. Evolutionary Algorithms in Engineering and Computer Science. John Wiley &
Sons, Ltd, Chichester, UK, July 16, 1999. ISBN: 0-4719-9902-4, 978-0-47199-902-7.
Kaisa Miettinen, Marko M. Mäkelä, Pekka Neittaanmäki, and Jacques Periaux,
editors. European Short Course on Genetic Algorithms and Evolution Strategies,
Proceedings of EUROGEN 1999, May 30–June 3, 1999, University of Jyväskylä,
Jyväskylä, Finland.
Mitsunori Miki, Tomoyuki Hiroyasu, and Jun’ya Wako. Adaptive temperature schedule determined by genetic algorithm for parallel simulated annealing. In The 2003
Congress on Evolutionary Computation, CEC’03, 2003. In proceedings [1803]. Online available at http://mikilab.doshisha.ac.jp/dia/research/person/wako/
society/cec2003/cec03_wako.pdf [accessed 2007-09-15].
Brad L. Miller and David E. Goldberg. Genetic algorithms, tournament selection, and
the effects of noise. IlliGAL Report 95006, Illinois Genetic Algorithms Laboratory,
Department of General Engineering, University of Illinois, Urbana-Champaign, 117
Transportation Building, 104 South Mathews Avenue, Urbana, IL 61801, USA, July
1995. See also [1416]. Online available at http://citeseer.ist.psu.edu/86198.
html and http://www.illigal.uiuc.edu/pub/papers/IlliGALs/95006.ps.Z [accessed 2007-07-28].
Brad L. Miller and David E. Goldberg. Genetic algorithms, selection schemes, and
the varying effects of noise. Evolutionary Computation, 4(2):113–131, Summer 1996.
ISSN: 1063-6560. doi:10.1162/evco.1996.4.2.113. See also [1415]. Online available
at http://citeseer.ist.psu.edu/110556.html and http://citeseerx.ist.
psu.edu/viewdoc/download;jsessionid=4225507A21F8083F025E28499309D1FB?
doi=10.1.1.31.3449&rep=rep1&type=pdf [accessed 2008-07-21].
Brad L. Miller and Michael J. Shaw. Genetic algorithms with dynamic niche sharing for multimodal function optimization. IlliGAL Report 95010, Department of
General Engineering, University of Illinois at Urbana-Champaign, 117 Transportation Building, 104 South Mathews Avenue, Urbana, IL 61801, USA, December 1,
1995. Online available at http://citeseer.comp.nus.edu.sg/5466.html [accessed
http://www.illigal.uiuc.edu/pub/papers/IlliGALs/95010.ps.Z]2008-03-15.
Julian Francis Miller. An empirical study of the efficiency of learning boolean
functions using a cartesian genetic programming approach. In Proceedings of
the Genetic and Evolutionary Computation Conference, volume 2, pages 1135–
1142, 1999. In proceedings [142]. Online available at http://citeseer.ist.psu.
edu/miller99empirical.html and http://www.elec.york.ac.uk/intsys/users/
jfm7/gecco1999b-miller.pdf [accessed 2007-11-02].
Julian Francis Miller and Peter Thomson. Evolving digital electronic circuits for realvalued function generation using a genetic algorithm. In Genetic Programming 1998:
Proceedings of the Third Annual Conference, pages 863–868, 1998. In proceedings
REFERENCES
[1420]
[1421]
[1422]
[1423]
[1424]
[1425]
[1426]
[1427]
[1428]
[1429]
[1430]
[1431]
715
[1209]. Online available at http://citeseer.ist.psu.edu/miller98evolving.
html [accessed 2007-11-03].
Julian Francis Miller and Peter Thomson. Aspects of digital evolution: Evolvability
and architecture. In Parallel Problem Solving from Nature – PPSN V, pages 927–
936, 1998. In proceedings [624]. Online available at http://citeseer.ist.psu.edu/
miller98aspects.html and http://www.elec.york.ac.uk/intsys/users/jfm7/
ppsn1998-miller-thomson.pdf [accessed 2007-11-03].
Julian Francis Miller and Peter Thomson. Aspects of digital evolution: Geometry
and learning. In Evolvable Systems: From Biology to Hardware, volume 1478/1998
of Lecture Notes in Computer Science (LNCS), pages 25–35. Springer Berlin/Heidelberg, 1998. ISBN: 978-3-54064-954-0. doi:10.1007/BFb0057601. Online available at http://citeseer.ist.psu.edu/40293.html and http://www.elec.york.
ac.uk/intsys/users/jfm7/ices1998-miller-thomson.pdf [accessed 2007-11-03].
Julian Francis Miller and Peter Thomson. Cartesian genetic programming. In
Genetic Programming, Proceedings of EuroGP’2000, pages 121–132, 2000. In proceedings [1666]. Online available at http://citeseer.ist.psu.edu/424028.html
and http://www.elec.york.ac.uk/intsys/users/jfm7/cgp-eurogp2000.pdf [accessed 2007-11-02].
Julian Francis Miller, Marco Tomassini, Pier Luca Lanzi, Conor Ryan, Andrea Tettamanzi, and William B. Langdon, editors. Proceedings of the 4th European Conference on Genetic Programming, EuroGP 2001, volume 2038/2001 of Lecture Notes in
Computer Science (LNCS), April 18-20, 2001, Lake Como, Italy. Springer Berlin/Heidelberg. ISBN: 3-5404-1899-7.
Hokey Min, Tomasz G. Smolinski, and Grzegorz M. Boratyn. A genetic algorithmbased data mining approach to profiling the adopters and non-adopters of epurchasing. In W. W. Smari, editor, Information Reuse and Integration, Third International Conference, IRI-2001, pages 1–6. International Society for Computers and
Their Applications (ISCA), 2001. Online available at http://citeseer.ist.psu.
edu/min01genetic.html [accessed 2007-07-29].
Marvin Lee Minsky. Steps toward artificial intelligence. In Proceedings of the IRE,
volume 49(1), pages 8–30, 1961. Reprint: Feigenbaum & Feldman, Computers and
Thought, 1963, luger.
Marvin Lee Minsky. Computation: Finite and Infinite Machines. Prentica Hall Series
on Automatic Computation. Prentice Hall, June 1967. ISBN: 978-0-13165-563-8.
Marvin Lee Minsky. Berechnung: Endliche und Unendliche Maschinen. Verlag
Berliner Union GmbH, Stuttgart, 1971. ISBN: 978-3-40853-029-4.
Marvin Lee Minsky. Steps toward artificial intelligence. In Edward A. Feigenbaum
and Julian Feldman, editors, Computers & thought, pages 406–450. MIT Press, Cambridge, MA, USA, 1995. ISBN: 0-2625-6092-5. Online available at http://web.
media.mit.edu/~minsky/papers/steps.html [accessed 2007-08-05].
Daniele Miorandi, Paolo Dini, Eitan Altman, and Hisao Kameda. WP 2.2 – Paradigm
Applications and Mapping, D2.2.2 Framework for Distributed On-line Evolution of
Protocols and Services. BIOlogically inspired NETwork and Services (BIONETS) and
Future and Emerging Technologies (FET) project of the EU, 2nd edition, June 14,
2007. BIONETS/CN/wp2.2/v2.1. Editor: Lidia A. R. Yamamoto. Verification David
Linner and Françoise Baude. Status: Final, Public. Online available at http://www.
bionets.eu/docs/BIONETS_D2_2_2.pdf [accessed 2008-06-23].
Boris Mirkin. Clustering for Data Mining: A Data Recovery Approach. Computer Science and Data Analysis. Chapman & Hall/CRC, April 2005. ISBN:
978-1-58488-534-4.
Melanie Mitchell. An Introduction to Genetic Algorithms. Complex Adaptive Systems. The MIT Press, reprint edition, February 1998. ISBN: 0-2626-3185-7.
716
REFERENCES
[1432] Melanie Mitchell, Stephanie Forrest, and John Henry Holland. The royal road for
genetic algorithms: Fitness landscapes and GA performance. In Towards a Practice
of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, pages 245–254, 1991. In proceedings [2108]. Online available at http://
citeseer.ist.psu.edu/mitchell91royal.html and http://web.cecs.pdx.edu/
~mm/ecal92.pdf [accessed 2007-10-15].
[1433] Tom M. Mitchell. Generalization as search. In Bonnie Lynn Webber and Nils J.
Nilsson, editors, Readings in Artificial Intelligence, pages 517–542. Tioga Pub. Co.
Press / Morgan Kaufmann Publishers / Elsevier Science & Technology Books, 2nd
edition, February 1981. ISBN: 0-9353-8203-8, 978-0-93538-203-7, 0-9346-1303-6,
978-0-93461-303-3. See also [1434].
[1434] Tom M. Mitchell. Generalization as search. Artificial Intelligence, 18(2):203–226,
March 1982. ISSN: 0004-3702. doi:10.1016/0004-3702(82)90040-6. See also [1433].
[1435] Tom M. Mitchell and Reid G. Smith, editors. Proceedings of the 7th National Conference on Artificial Intelligence, AAAI, August 21–26, 1988, St. Paul, Minnesota,
USA. AAAI Press/The MIT Press. ISBN: 0-2625-1055-3. See http://www.aaai.
org/Conferences/AAAI/aaai88.php [accessed 2007-09-06].
[1436] Peter Mitic. Critical values for the wilcoxon signed rank statistic. The Mathematica
Journal, 6(3):73–77, 1996.
[1437] Debasis Mitra, Fabio Romeo, and Alberto Sangiovanni-Vincentelli. Convergence and
finite-time behavior of simulated annealing. In Proceedings of the 24th IEEE Conference on Decision and Control, volume 24, pages 761–767. IEEE Computer Society,
December 1985. doi:10.1109/CDC.1985.268600.
[1438] Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, January 2005. ISBN:
0-5218-3540-2.
[1439] Jun’ichi Mizoguchi, Hitoshi Hemmi, and Katsunori Shimohara. Production genetic
algorithms for automated hardware design through an evolutionary process. In IEEE
World Congresson Computational Intelligence, Proceedings of the First IEEE Conference on Evolutionary Computation, volume 2, pages 661–664. IEEE Press, June 27–
29, 1994. doi:10.1109/ICEC.1994.349980.
[1440] Andreas F. Molisch. Wireless Communications. John Wiley & Sons / IEEE Press,
November 18, 2005. ISBN: 978-0-47084-887-6, 0-4708-4887-1. Partly online available
at http://books.google.com/books?id=2NNCHgAACAAJ [accessed 2008-07-27].
[1441] Nicolas Monmarché, El-Ghazali Talbi, Pierre Collet, Marc Schoenauer, and Evelyne
Lutton, editors. Revised Selected Papers of the 8th International Conference on Artificial Evolution, Evolution Artificielle, EA 2007, Lecture Notes in Computer Science (LNCS), October 29–31, 2007, Tours, France. Springer Berlin/Heidelberg/New
York. ISBN: 978-3-54079-304-5, 3-5407-9304-6. doi:10.1007/978-3-540-79305-2. See
http://ea07.hant.li.univ-tours.fr/ [accessed 2007-09-09]. Published in 2008.
[1442] Raul Monroy, Gustavo Arroyo-Figueroa, Luis Enrique Sucar, and Juan Humberto Sossa Azuela, editors. Proceedings of the MICAI 2004: Advances in Artificial Intelligence, Third Mexican International Conference on Artificial Intelligence, volume
2972/2004 of Lecture Notes in Computer Science (LNCS), Subseries Lecture Notes
in Artificial Intelligence (LNAI), April 26–30, 2004, Mexico City, México. Springer
Berlin / Heidelberg. ISBN: 3-5402-1459-3, 978-3-54021-459-5. doi:10.1007/b96521.
[1443] David Montana and Talib Hussain. Adaptive reconfiguration of data networks
using genetic algorithms.
Applied Soft Computing, 4(4):433–444, September
2004. doi:10.1016/j.asoc.2004.02.002. See also [1445]. Online available at http://
citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.95.1975 [accessed 2008-10-16].
[1444] David Montana and Jason Redi. Optimizing parameters of a mobile ad hoc
network protocol with a genetic algorithm. In GECCO’05: Proceedings of the
2005 conference on Genetic and evolutionary computation, pages 1993–1998, 2005.
REFERENCES
[1445]
[1446]
[1447]
[1448]
[1449]
[1450]
[1451]
[1452]
[1453]
[1454]
[1455]
[1456]
[1457]
717
doi:10.1145/1068009.1068342. Online available at http://vishnu.bbn.com/papers/
erni.pdf and http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.
86.5827 [accessed 2008-10-16]. In proceedings [202].
David Montana, Talib Hussain, and Tushar Saxena. Adaptive reconfiguration of data
networks using genetic algorithms. In GECCO’02: Proceedings of the Genetic and
Evolutionary Computation Conference, pages 1141–1149, 2002. In proceedings [1245].
See also [1443].
David J. Montana. Strongly typed genetic programming. BBN Technical Report
#7866, Bolt Beranek and Newman Inc. (BBN), 70 Fawcett Street, Cambridge, MA
02138, dmontana@bbn.com, May 7, 1993. Online available at http://www.cs.ucl.
ac.uk/staff/W.Langdon/ftp/ftp.io.com/papers/stgp.ps.Z [accessed 2007-10-04]. Superseded by [1447].
David J. Montana. Strongly typed genetic programming. BBN Technical Report #7866, Bolt Beranek and Newman Inc. (BBN), 70 Fawcett Street, Cambridge, MA 02138, dmontana@bbn.com, March 25, 1994.
Online available
at http://citeseer.ist.psu.edu/345471.html and http://www.cs.ucl.ac.uk/
staff/W.Langdon/ftp/ftp.io.com/papers/stgp2.ps.Z [accessed 2007-10-04]. Superseds
[1446] and is itself superseded by [1448].
David J. Montana. Strongly typed genetic programming. Evolutionary Computation,
3(2):199–230, 1995. Online available at http://vishnu.bbn.com/papers/stgp.pdf
[accessed 2007-10-04] (November 20, 2002 edition).
The Seventh Metaheuristics International Conference, June 25–29, 2007, Montréal,
Québec, Canada. See http://www.mic2007.ca/ [accessed 2007-09-12].
Federico Morán, Alvaro Moreno, Juan J. Merelo Guervós, and Pablo Chacón, editors. Advances in Artificial Life, Proceedings of the Third European Conference on
Artificial Life, volume 929 of Lecture Notes in Computer Science (LNCS), June 4–6,
1995, Granada, Spain. Springer. ISBN: 3-5405-9496-5.
Conwy Lloyd Morgan.
On modification and variation.
Science, 4(99):
733–740, November 20, 1896.
ISSN: 0036-8075 (print), 1095-9203 (online).
doi:10.1126/science.4.99.733. See also [1452].
Conwy Lloyd Morgan. On modification and variation. In Adaptive individuals in
evolving populations: models and algorithms, pages 81–90. Addison-Wesley Longman
Publishing Co., Inc., 1996. In collection [171]. See also [1451].
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, volume 1, August 20–25, 1995, Montréal, Québec, Canada. Morgan Kaufmann,
San Francisco, CA, USA. ISBN: 1-5586-0363-8. Online available at http://dli.
iiit.ac.in/ijcai/IJCAI-95-VOLt.htm [accessed 2008-04-01]. See also [1454, 2190, 1364].
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, volume 2, August 20–25, 1995, Montréal, Québec, Canada. Morgan Kaufmann,
San Francisco, CA, USA. ISBN: 1-5586-0363-8. Online available at http://dli.
iiit.ac.in/ijcai/IJCAI-95-VOL2/CONTENT/content.htm [accessed 2008-04-01]. See also
[1453, 2190, 1364].
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, volume 1, August 23–29, 1997, Nagoya, Japan. Morgan Kaufmann, San Francisco, CA, USA. Online available at http://dli.iiit.ac.in/
ijcai/IJCAI-97-VOL1/CONTENT/content.htm [accessed 2008-04-01]. See also [1456, 1703].
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97, volume 2, August 23–29, 1997, Nagoya, Japan. Morgan Kaufmann, San Francisco, CA, USA. Online available at http://dli.iiit.ac.in/
ijcai/IJCAI-97-VOL2/CONTENT/content.htm [accessed 2008-04-01]. See also [1455, 1703].
Naoki Mori, Hajime Kita, and Yoshikazu Nishikawa. Adaptation to a changing environment by means of the thermodynamical genetic algorithm.
In
718
[1458]
[1459]
[1460]
[1461]
[1462]
[1463]
[1464]
[1465]
[1466]
[1467]
[1468]
[1469]
[1470]
[1471]
REFERENCES
Parallel Problem Solving from Nature – PPSN IV, pages 513–522, 1996.
doi:10.1007/3-540-61723-X 1015. In proceedings [2118].
Naoki Mori, Seiji Imanishi, Hajime Kita, and Yoshikazu Nishikawa. Adaptation to
changing environments by means of the memory based thermodynamical genetic
algorithm. In Proceedings of The Seventh International Conference on Genetic Algorithms, ICGA’97, pages 299–306, 1997. In proceedings [98].
Naoki Mori, Hajime Kita, and Yoshikazu Nishikawa. Adaptation to a changing environment by means of the feedback thermodynamical genetic algorithm.
In Parallel Problem Solving from Nature – PPSN V, pages 149–158, 1998.
doi:10.1007/BFb0056858. In proceedings [624].
David E. Moriarty, Alan C. Schultz, and John J. Grefenstette.
Evolutionary algorithms for reinforcement learning. Journal of Artificial Intelligence Research, 11:241–276, September 1999. Online available at http://citeseer.ist.
psu.edu/moriarty99evolutionary.html and http://www.jair.org/media/613/
live-613-1809-jair.pdf [accessed 2007-09-12].
Ronald Morrison. On the Development of Algol. PhD thesis, Department of Computational Science, University of St Andrews, December 1979. Online available at
http://www-old.cs.st-andrews.ac.uk/research/publications/Mor79a.php [accessed 2007-07-10].
Ronald W. Morrison and Kenneth Alan De Jong. Measurement of population diversity. In Artificial Evolution, pages 1047–1074, 2001. doi:10.1007/3-540-46033-0 3.
In proceedings [428]. Online available at http://citeseerx.ist.psu.edu/viewdoc/
summary?doi=10.1.1.108.1903 [accessed 2008-11-10].
Ronald Walter Morrison. Designing Evolutionary Algorithms for Dynamic Environments. PhD thesis, George Mason University, USA, 2002. Advisor: Kenneth Alan
De Jong. See also [1464].
Ronald Walter Morrison. Designing Evolutionary Algorithms for Dynamic Environments, volume 24(1) of Natural Computing. Springer, Berlin, June 2004. ISBN:
978-3-54021-231-7. See also [1463].
Ronald Walter Morrison and Kenneth Alan De Jong. A test problem generator for non-stationary environments. In Proceedings of the 1999 Congress
on Evolutionary Computation, CEC 99, volume 3, pages 2047–2053, 1999.
doi:10.1109/CEC.1999.785526. In proceedings [69].
Joel N. Morse.
Reducing the size of the nondominated set: Pruning by clustering.
Computers & Operations Research, 7(1–2):55–66, 1980.
doi:10.1016/0305-0548(80)90014-3.
Joel N. Morse, editor. Proceedings of the 4th International Conference on Multiple Criteria Decision Making: Organizations, Multiple Agents With Multiple Criteria (MCDM’1980), Lecture Notes in Economics and Mathematical Systems, 1980,
Newark, Delaware, USA. Springer. ISBN: 978-0-38710-821-6. Published in July 1981.
Pablo Moscato. On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical Report C3P 826, Caltech Concurrent Computation Program 158-79, California Institute of Technology, Pasadena,
CA 91125, USA, Pasadena, CA, 1989. Online available at http://www.densis.fee.
unicamp.br/~moscato/papers/bigone.ps [accessed 2007-08-18].
Pablo Moscato. Memetic algorithms. In Handbook of Applied Optimization, chapter
3.6.4, pages 157–167. Oxford University Press, 2002. In collection [1613].
Pablo Moscato and Carlos Cotta. A gentle introduction to memetic algorithms. In
Handbook of Metaheuristics, chapter 5, pages 105–144. Kluwer Academic Publishers,
2003. doi:10.1007/0-306-48056-5 5. In collection [813]. Online available at http://
citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.5300 [accessed 2008-09-11].
Sanaz Mostaghim. Multi-objective Evolutionary Algorithms: Data structures, Convergence and, Diversity. PhD thesis, Fakultät für Elektrotechnik, Informatik und
REFERENCES
[1472]
[1473]
[1474]
[1475]
[1476]
[1477]
[1478]
[1479]
[1480]
[1481]
[1482]
[1483]
719
Mathematik, Universität Paderborn, Deutschland (Germany), Sharker Verlag, 2004.
Online available at http://deposit.ddb.de/cgi-bin/dokserv?idn=974405604
and http://ubdata.uni-paderborn.de/ediss/14/2004/mostaghi/disserta.pdf
[accessed 2007-08-17].
Jack Mostow and Chuck Rich, editors. Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial
Intelligence Conference, AAAI 98, IAAI 98, July 26–30, 1998, Madison, Wisconsin, USA. AAAI Press/The MIT Press. ISBN: 0-2625-1098-7. See http://www.
aaai.org/Conferences/AAAI/aaai98.php [accessed 2007-09-06] and http://www.aaai.
org/Conferences/IAAI/iaai98.php [accessed 2007-09-06].
Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge
International Series on Parallel Computation. Cambridge University Press, August
1995. ISBN: 978-0-52147-465-8.
Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. ACM Comput.
Surv., 28(1):33–37, 1996. ISSN: 0360-0300.
Gero Mühl. Lecture notes “verteilte systeme”, lesson “einführung und motivation,
2006. Online available at http://kbs.cs.tu-berlin.de/teaching/sose2006/vs/
folien/02.pdf [accessed 2008-02-09].
Heinz Mühlenbein. Parallel genetic algorithms, population genetics and combinatorial optimization. In Parallelism, Learning, Evolution, pages 398–406, 1989.
doi:10.1007/3-540-55027-5 23. In proceedings [164]. See also [1477].
Heinz Mühlenbein. Parallel genetic algorithms, population genetics and combinatorial optimization. In Proceedings of the third international conference on Genetic
algorithms, pages 416–421, 1989. In proceedings [1820]. See also [1476].
Heinz Mühlenbein. Evolution in time and space – the parallel genetic algorithm. In
Foundations of Genetic Algorithms 1, pages 316–337, 1990. In proceedings [1924]. Online available at http://muehlenbein.org/parallel.PDF and http://citeseer.
ist.psu.edu/11201.html [accessed 2007-11-30].
Heinz Mühlenbein. How genetic algorithms really work – i. mutation and hillclimbing.
In Parallel Problem Solving from Nature 2, pages 15–26, 1992. In proceedings [1357].
Online available at http://www.iais.fraunhofer.de/fileadmin/images/pics/
Abteilungen/INA/muehlenbein/PDFs/technical/how-genetic-algorithms.pdf
[accessed 2008-09-12].
Heinz Mühlenbein. Parallel genetic algorithms in combinatorial optimization. In
Osman Balci, Ramesh Sharda, and Stavros A. Zenios, editors, Selected papers from the
Conference Computer Science and Operations Research: New Developments in Their
Interfaces, pages 441–456, January 8–10, 1992, Williamsburg, Virginia. Pergamon
Press, Oxford. ISBN: 0-0804-0806-0, 978-0-08040-806-4. Online available at http://
citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.990 [accessed 2008-06-23].
Heinz Mühlenbein and Dirk Schlierkamp-Voosen. Predictive models for the breeder
genetic algorithm i: Continuous parameter optimization. Evolutionary Computations,
1(1):25–49, Spring 1993. ISSN: 1063-6560, 2049097. Online available at http://
citeseer.ist.psu.edu/mtihlenbein93predictive.html [accessed 2008-07-21].
Srinivas Mukkamala, Andrew H. Sung, and Ajith Abraham. Modeling intrusion detection systems using linear genetic programming approach. In Robert Orchard,
Chunsheng Yang, and Moonis Ali, editors, Proceedings of the 17th International
Conference on Industrial and Engineering Applications of Artificial Intelligence and
Expert Systems, IEA/AIE 2004, volume 3029/2004 of Lecture Notes in Computer
Science (LNCS), pages 633–642. Springer Springer Verlag Inc, May 17–20, 2004, Ottawa, Canada. ISBN: 3-5402-2007-0, 978-3-54022-007-7. doi:10.1007/b97304. Online
available at http://www.rmltech.com/LGP%20Based%20IDS.pdf [accessed 2008-06-17].
Markus Müller-Olm, David A. Schmidt, and Bernhard Steffen. Model checking:
A tutorial introduction. In Agostino Cortesi and Gilberto Filé, editors, Proceed-
720
[1484]
[1485]
[1486]
[1487]
[1488]
[1489]
[1490]
[1491]
[1492]
[1493]
REFERENCES
ings of the 6th Static Analysis Symposium SAS’99, volume 1694 of Lecture Notes in
Computer Science (LNCS), pages 330–354. Springer-Verlag, September 22–24 1999,
Venice, Italy. ISBN: 0-5436-6459-9, 978-3-54066-459-8. doi:10.1007/3-540-48294-6 22.
Online available at http://people.cis.ksu.edu/~schmidt/papers/sas99.ps.gz
[accessed 2008-10-02].
Masaharu Munetomo. Designing genetic algorithms for adaptive routing algorithms
in the internet. In Evolutionary Telecommunications: Past, Present, and Future,
pages 215–216, 1999. In proceedings [154]. Online available at http://citeseer.
ist.psu.edu/198441.html and http://uk.geocities.com/markcsinclair/ps/
etppf_mun.ps.gz [accessed 2008-06-25]. Presentation online available at http://uk.
geocities.com/markcsinclair/ps/etppf_mun_slides.ps.gz and http://assam.
cims.hokudai.ac.jp/~munetomo/documents/gecco99-ws.ppt [accessed 2008-06-25].
Masaharu Munetomo and David E. Goldberg. Linkage identification by nonmonotonicity detection for overlapping functions. IlliGAL Report 99005, Illinois Genetic Algorithms Laboratory (IlliGAL), University of Illinois at Urbana-Champaign,
117 Transportation Building, 104 S. Mathews Avenue, Urbana, IL 61801, USA, January 1999. Online available at http://citeseerx.ist.psu.edu/viewdoc/summary?
doi=10.1.1.33.9322 and http://www.illigal.uiuc.edu/pub/papers/IlliGALs/
99005.ps.Z [accessed 2008-10-17]. See also [1486].
Masaharu Munetomo and David E. Goldberg. Linkage identification by nonmonotonicity detection for overlapping functions. Evolutionary Computation, 7(4):
377–398, Winter 1999. ISSN: 1063-6560, 1530-9304. doi:10.1162/evco.1999.7.4.377.
See also [1485].
Masaharu Munetomo, Yoshiaki Takai, and Yoshiharu Sato. An adaptive network
routing algorithm employing path genetic operators. In Proceedings of the Seventh
International Conference on Genetic Algorithms, pages 643–649, 1997. In proceedings
[98].
Masaharu Munetomo, Yoshiaki Takai, and Yoshiharu Sato. An adaptive routing algorithm with load balancing by a genetic algorithm. Transactions of the Information
Processing Society of Japan (IPSJ), 39(2):219–227, 1998. in Japanese.
Masaharu Munetomo, Yoshiaki Takai, and Yoshiharu Sato. A migration scheme for
the genetic adaptive routing algorithm. In Proceedings of the 1998 IEEE Conference on Systems, Man, and Cybernetics, volume 3, pages 2774–2779. IEEE Press,
October 11–14, 1998, San Diego, U.S.A. doi:10.1109/ICSMC.1998.725081.
Tadahiko Murata and Takashi Nakamura. Developing cooperation of multiple agents
using genetic network programming with automatically defined groups. In Late Breaking Papers at the 2004 Genetic and Evolutionary Computation Conference, 2004. In
proceedings [1113].
Tadahiko Murata and Takashi Nakamura. Multi-agent cooperation using genetic network programming with automatically defined groups. In Genetic and Evolutionary
Computation – GECCO 2004, pages 712–714, 2004. In proceedings [545].
Tadahiko Murata and Takashi Nakamura. Genetic network programming with
automatically defined groups for assigning proper roles to multiple agents. In
GECCO’05: Proceedings of the 2005 conference on Genetic and evolutionary computation, pages 1705–1712, 2005. doi:10.1145/1068009.1068294. In proceedings
[202]. Online available at http://www.cs.bham.ac.uk/~wbl/biblio/gecco2005/
docs/p1705.pdf and http://doi.acm.org/10.1145/1068009.1068294 [accessed 200806-16].
M. Musil, M. J. Wilmut, and N. R. Chapman. A hybrid simplex genetic algorithm for
estimating geoacoustic parameters using matched-field inversion. IEEE Journal of
Oceanic Engineering, 24(3):358–369, July 1999. ISSN: 0364-9059. CODEN: IJOEDY.
INSPEC Accession Number: 6322331. doi:10.1109/48.775297.