Robert K. Lindsay
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Robert K. Lindsay has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Michael D. Gordon
University of Michigan Business School, 701 Tappan Street, Ann Arbor, MI 48109
2 shared publications Annie S. Wu
Artificial Intelligence Laboratory University of Michigan Ann Arbor, MI 48109-2110
1 shared publication
Latest Publications
- 22 April 1999
- Published by Wiley in Journal of the American Society for Information Science
- Vol. 50 (7) , 574-587
Literature-based discovery by lexical statistics
- 22 April 1999
- Published by Wiley in Journal of the American Society for Information Science
- Vol. 50 (7) , 574-587
Literature-based discovery by lexical statistics
- 1 January 1999
- Published by Wiley in Journal of the American Society for Information Science
- Vol. 50 (7) , 574-587
Literature-based discovery by lexical statistics
- 1 January 1999
- Published by Wiley in Journal of the American Society for Information Science
- Vol. 50 (7) , 574-587
Literature-based discovery by lexical statistics
- 1 June 1995
- Published by MIT Press in Evolutionary Computation
- Vol. 3 (2) , 121-147
Empirical Studies of the Genetic Algorithm with Noncoding Segments
The genetic algorithm (GA) is a problem-solving method that is modeled after the process of natural selection. We are interested in studying a specific aspect of the GA: the effect of noncoding segments on GA performance. Noncoding segments are segments of bits in an individual that provide no contribution, positive or negative, to the fitness of that individual. Previous research on noncoding segments suggests that including these structures in the GA may improve GA performance. Understanding when and why this improvement occurs will help us to use the GA to its full potential. In this article we discuss our hypotheses on noncoding segments and describe the results of our experiments. The experiments may be separated into two categories: testing our program on problems from previous related studies, and testing new hypotheses on the effect of noncoding segments.
- 1 June 1995
- Published by MIT Press in Evolutionary Computation
- Vol. 3 (2) , 121-147
Empirical Studies of the Genetic Algorithm with Noncoding Segments
The genetic algorithm (GA) is a problem-solving method that is modeled after the process of natural selection. We are interested in studying a specific aspect of the GA: the effect of noncoding segments on GA performance. Noncoding segments are segments of bits in an individual that provide no contribution, positive or negative, to the fitness of that individual. Previous research on noncoding segments suggests that including these structures in the GA may improve GA performance. Understanding when and why this improvement occurs will help us to use the GA to its full potential. In this article we discuss our hypotheses on noncoding segments and describe the results of our experiments. The experiments may be separated into two categories: testing our program on problems from previous related studies, and testing new hypotheses on the effect of noncoding segments.