Next: About this document ...
Up: Silicon Cluster Optimization Using
Previous: Conclusion
- 1
-
J. Niesse and H. Mayne, ``Global Geometry Optimization of Atomic
Clusters Using A Modified Genetic Algorithm ins Space-Fixed
Coordinates,'' J. Chem. Phys., vol. 105, no. 11, pp. 4700-4706,
1996.
- 2
-
M. Hoare, ``Structure and Dynamics of Simple Microclusters,'' Adv.
Chem. Phys., vol. 40, pp. 49-135, 1979.
- 3
-
J. Northby, ``Structure and Binding of Lennard-Jones Clusters:13,''
J. Chem. Phys., vol. 87, no. 10, pp. 6166-6177, 1987.
- 4
-
L. Wille and J. Vennik, ``Computational Complexity of the Ground-State
Determination of Atomic Clusters,'' J. Phys. A, vol. 18, no. 8,
pp. L419-L422, 1985.
- 5
-
D. Goldberg, Genetic Algorithms in Search Optimization and Machine
Learning.
Reading, MA: Addison-Wesley, 1989.
- 6
-
D. E. Goldberg, Evolutionary Design by Computers, ch. 4. The Race, the
Hurdle, and the Sweet Spot: Lessons from Genetic Algorithms for
the Automation of Design Innovation and Creativity, pp. 105-118. San Mateo, CA: Morgan Kaufmann, 1999.
- 7
-
G. Harik, ``Linkage Learning via Probabilistic Modeling in the
ECGA,'' IlliGAL Report No. 99010, University of Illinois at Urbana-Champaign, Urbana, IL, January 1999.
- 8
-
S. Gregurick and M. Alexander, ``Global Geometry Optimization of (Ar)n and B(Ar)n Clusters Using A Modified Genetic Algorithm,''
J. Chem. Phys., vol. 104, no. 7, pp. 2684-2691, 1996.
- 9
-
Y. Zeiri, E. Fattal, and R. Kosloff, ``Application of Genetic Algorithm to
the Calculation of Bound States and Local Density
Approximations,'' J. Chem. Phys., vol. 102, no. 4, pp. 1859-1862,
1995.
- 10
-
M. Iwamatsu, ``Global Geometry Optimization of Silicon Clusters Using
the Space-Fixed Genetic Algorithm,'' J. Chem. Phys., vol. 112,
no. 24, pp. 10976-10983, 2000.
- 11
-
B. Hartke, ``Global Geometry Optimization of Clusters Using Genetic
Algorithm,'' J. Phys. Chem., vol. 97, pp. 9973-9976, 1993.
- 12
-
B. Hartke, ``Global Geometry Optimisation of Clusters Using a Growth
Strategy Optimized by a Genetic Algorithm,'' Chem. Phy. Let.,
vol. 240, pp. 560-565, 1995.
- 13
-
R. Judson, ``Genetic Algorithms and Their Use in Chemistry.,'' Rev. Comput. Chem, vol. 10, pp. 1-73, 1997.
- 14
-
Y. Zeiri, ``Study of the Lowest Energy Structure of Atomic Clusters
Using a Genetic Algorithm.,'' Comput. Phys. Commun., vol. 103,
no. 1, pp. 28-42, 1997.
- 15
-
D. Deaven and K. Ho, ``Molecular Geometry Optimization With A Genetic
Algorithm,'' Phy. Rev. Let., vol. 75, pp. 288-291, 1995.
- 16
-
W. Press, B. Flannery, S. Teukolsky, and W. Vettering, Numerical Recipes
in C.
Cambridge: Cambridge University Press, 1989.
- 17
-
D. Goldberg, D. Thierens, and K. Deb, ``Toward a Better Understanding of Mixing in Genetic Algorithms,'' J. Soc. Instrument and Control
Engineers, vol. 32, no. 1, pp. 10-16, 1993. (Also IlliGAL Report No. 92009).
- 18
-
D. Thierens, Analysis and Design of Genetic Algorithms.
PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium, 1994.
- 19
-
D. Thierens and D. Goldberg, ``Mixing in Genetic Algorithms,'' in International Conference On Genetic Algorithms (S. Forrest, ed.), (San Mateo, CA), pp. 38-45, Morgan Kaufmann, 1993.
- 20
-
D. Goldberg, K. Deb, H. Kargupta, and G. Harik, ``Rapid, Accurate Optimization of Difficult Problems Using Fast Messy Genetic
Algorithms,'' in International Conference on Genetic Algorithms, (San Mateo, CA), pp. 56-64, Morgan Kaufmann, 1993.
- 21
-
H. Kargupta, ``The Gene Expression Messy Genetic Algorithm,'' in
International Conference on Evolutionary Computation, (Piscataway, NJ), pp. 814-819, IEEE Service Center, 1996.
- 22
-
M. Munetomo and D. Goldberg, ``Linkage Identification by
Non-Monotonicity Detection for Overlapping Functions,'' Evolutionary Computation, vol. 7, no. 4, pp. 377-398, 1999.
- 23
-
G. Harik and D. E. Goldberg, ``Learning Linkage,'' in Foundations of
Genetic Algorithms (R. Belew and M. Vose, eds.), vol. 4, (San Francisco,
CA), pp. 247-262, Morgan Kaufmann Publishers, Inc, 1997. (Also IlliGAL Report No. 96006).
- 24
-
M. Pelikan, D. E. Goldberg, and E. Cantu-Paz, ``Bayesian Optimization
Algorithm, Population Sizing and Time to Convergence,'' IlliGAL
Report No. 2000001, University of Illinois at Urbana-Champaign, Urbana, IL,
2000.
- 25
-
K. Sastry and D. Goldberg, ``On Extended Compact Genetic Algorithm,''
IlliGAL Report No. 2000026, University of Illinois at Urbana-Champaign,
Urbana, IL, 2000.
- 26
-
F. Stillinger and T. Weber, ``Computer Simulation of Local Order in
Condensed Phases of Silicon,'' Phys. Rev. B, vol. 31, no. 8,
pp. 5262-5271, 1985.
- 27
-
J. Tersoff, ``New Empirical Approach for the Structure and Energy of
Covalent Systems,'' Phys. Rev. B, vol. 37, no. 12, pp. 6991-7000,
1988.
- 28
-
X. Gong, ``Empirical-Potential Studies on the Structural Properties of
Small Silicon Clusters,'' Phys. Rev. B, vol. 47, no. 4,
pp. 2329-2332, 1993.
- 29
-
S. Tsutsui, D. Goldberg, and K. Sastry, ``Progress Toward
Linkage-Identification in Real Coded GAs with Simplex
Crossover,'' IlliGAL Report No. 2000033, University of Illinois at
Urbana-Champaign, Urbana, IL, 2000.
- 30
-
D. Thierens, D. E. Goldberg, and A. G. Pereira, ``Domino Convergence,
Drift, and the Temporal-Salience Structure of Problems,'' in IEEE International Conference on Evolutionary Computation, (Piscataway, NJ),
pp. 535-540, IEEE Service Center, 1998.
- 31
-
G. Harik, F. Lobo, and D. E. Goldberg, ``The Compact Genetic
Algorithm,'' in IEEE Conference on Evolutionary Computation,
(Piscataway, NJ), pp. 523-528, IEEE Service Center, 1998. (Also IlliGAL Report No. 97006).
- 32
-
S. Baluja, ``Population-Based Incremental Learning: A Method of
Integrating Genetic Search Based Function Optimization and
Competitive Learning,'' Tech. Rep. CMU-CS-94-163, Carnegie Mellon
University, 1994.
- 33
-
F. Lobo and G. Harik, ``Extended Compact Genetic Algorithm in C++,''
IlliGAL Report No. 99016, University of Illinois at Urbana-Champaign,
Urbana, IL, January 1999.
Kumara Sastry
2001-04-02