next up previous
Next: About this document Up: Solving Similar Problems using Previous: CONCLUSIONS

References

Ackley, 1987
Ackley, D. A. (1987). A Connectionist Machine for Genetic Hillclimbing. Kluwer Academic Publishers.

Caldwell and Johnston, 1991
Caldwell, C. and Johnston, V. S. (1991). Tracking a criminal suspect through "Face-Space" with a genetic algorithm. In Proceedings of Fourth International Conference on Genetic Algorithms, pages 416-421. Morgan Kauffman.

Eshelman, 1991
Eshelman, L. J. (1991). The chc adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. In Rawlins, G. J. E., editor, Foundations of Genetic Algorithms-1, pages 265-283. Morgan Kauffman.

Goldberg, 1989
Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley.

Holland, 1975
Holland, J. (1975). Adaptation In Natural and Artificial Systems. The University of Michigan Press, Ann Arbour.

Koza, 1993
Koza, J. R. (1993). Genetic Programming. MIT Press.

Lin et al., 1995
Lin, Y.-H., Rawlins, G. J. E., and VanHeyningen, M. D. (1995). Pic1: A visual database interface. International Journal of Expert Systems Research and Applications, 8(3):237-246.

Liu, 1996
Liu, X. (1996). Combining Genetic Algorithm and Case-based Reasoning for Structure Design. University of Nevada, Reno. M.S. Thesis, Department of Computer Science.

Louis and Li, 1997a
Louis, S. J. and Li, G. (1997a). Augmenting genetic algorithms with memory to solve traveling salesman problems. In Wang, P. P., editor, Proceedings of the Third Joint Conference on Information Sciences, pages 108-111.

Louis and Li, 1997b
Louis, S. J. and Li, G. (1997b). Combining robot control strategies using genetic algorithms with memory. In Angeline, P. J., Reynolds, R. G., McDonnell, J. R., and Eberhart, R., editors, Lecture Notes in Computer Science 1213. Evolutionary Programming VI, Proceedings, pages 431-442. Springer-Verlag.

Louis et al., 1993
Louis, S. J., McGraw, G., and Wyckoff, R. (1993). Case-based reasoning assisted explanation of genetic algorithm results. Journal of Experimental and Theoretical Artificial Intelligence, 5:21-37.

Louis and Rawlins, 1991
Louis, S. J. and Rawlins, G. J. E. (1991). Designer genetic algorithms: Genetic algorithms in structure design. In Proceedings of the Fourth International Conference on Genetic Algorithms, pages 53-60. Morgan Kauffman, San Mateo, CA.

Louis and Rawlins, 1993
Louis, S. J. and Rawlins, G. J. E. (1993). Syntactic analysis of convergence in genetic algorithms. In Whitley, L. D., editor, Foundations of Genetic Algorithms - 2, pages 141-152. Morgan Kauffman, San Mateo, CA.

Powell et al., 1989
Powell, D. J., Tong, S. S., and Skolnik, M. M. (1989). Engeneous domain independent machine learning for design optimization. In Proceedings of the Third International Conference on Genetic Algorithms, pages 151-159. Morgan Kauffman.

Ramsey and Grefensttete, 1993
Ramsey, C. and Grefensttete, J. (1993). Case-based initialization of genetic algorithms. In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 84-91, San Mateo, California. Morgan Kauffman.

Riesbeck and Schank, 1989
Riesbeck, C. K. and Schank, R. C. (1989). Inside Case-Based Reasoning. Lawrence Erlbaum Associates, Cambridge, MA.

Schoenauer and Xanthakis, 1993
Schoenauer, M. and Xanthakis, S. (1993). Constrained ga optimization. In Proceedings of the Fifth International Conference on Genetic Algorithms, pages 573-580. Morgan Kauffman, San Mateo, CA.

Xu and Louis, 1996
Xu, Z. and Louis, S. J. (1996). Genetic algorithms for open shop scheduling and re-scheduling. In Proceedings of the ISCA 11th International Conference on Computers and Their Applications., pages 99-102, Raleigh, NC, USA. International Society for Computers and Their Applications.



Sushil J. Louis
Tue Oct 21 17:24:51 MST 1997