Population sizing of Dependency Detection by fitness difference classification

Lecture Notes in Computer Science

Volumn 3469, Issue , 2005, Pages 282-299

  Tsuji, Miwako ^a   Munetomo, Masaharu ^a   Akama, Kiyoshi ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; PERTURBATION TECHNIQUES; PROBLEM SOLVING;

COMPUTATION COSTS; DISTRIBUTION ALGORITHMS; POPULATION SIZING;

POPULATION STATISTICS;

EID: 24944520129     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513575_15     Document Type: Conference Paper

References (12)

1. [GD91] David E. Goldberg and Kalyanmoy Deb. A comparative analysis of selection schemes used in genetic algorithms. In Gregory J.E. Rawlins, editor, Foundations of Genetic Algorithms, pages 69-93. Morgan Kaufmann Publishers, 1991.
2. [GKD89] David E. Goldberg, Bradley Korb, and Kalyanmoy Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3(5):415-444, 1989.
3. [HCPGM97] Georges Harik, Erick Cantú-Paz, David E. Goldberg, and Brad L. Miller. The gambler's ruin problem, genetic algorithms, and the sizing of populations. In IEEECEP: Proceedings of The IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, pages 7-12, 1997.
4. [HW03] Robert B. Heckendorn and Alden H. Wright. Efficient linkage discovery by limited probing. In Proceedings of the 2003 Genetic and Evolutionary Computation Conference, pages 1003-1014. Morgan Kaufmann Publishers, 12-16 July 2003.
5. [Kar95] H. Kargupta. SEARCH, polynomial complexity, and the fast messy genetic algorithm. Technical Report 95008, University of Illinois at UrbanaChampaign, Urbana, IL, October 1995.
6. [LGP00] Fernando G. Lobo, David E. Goldberg, and Martin Pelikan. Time complexity of genetic algorithms on exponentially scaled problems. In Proceedings of the 2000 Genetic and Evolutionary Computation Conference, pages 151-158. Morgan Kaufmann Publishers, 10-12 July 2000.
7. [MG99] Masaharu Munetomo and David E. Goldberg. Identifying linkage groups by nonlinearity/non-monotonicity detection. In Proceedings of the 1999 Genetic and Evolutionary Computation Conference, pages 433-440, 7 1999.
8. [PGCP99] Martin Pelikan, David E. Goldberg, and Erick Cantú-Paz. BOA: The bayesian optimization algorithm. In Proceedings of the 1999 Genetic and Evolutionary Computation Conference, pages 525-532. Morgan Kaufmann Publishers, 1999.
9. [PSG02] Martin Pelikan, Kumara Sastry, and David E. Goldberg. Scalability of the bayesian optimization algorithm. International Journal of Approximate Reasoning, 31(3):221-258, 2002.
10. [Str04] Matthew J. Streeter. Upper bounds on the time and space complexity of optimizing additively separable functions. In Proceedings of the 2004 Genetic and Evolutionary Computation Conference, pages 186-197, 2004.
11. [TGP98] Dirk Thierens, David E. Goldberg, and Angela G. Pereira. Domino convergence, drift and the temporalsalience structure of problems. In Proceedings of the IEEE International Conference of Evolutionary Computation, pages 535-540, 1998.
12. [TMA04] Miwako Tsuji, Masaharu Munetomo, and Kiyoshi Akamae. Modeling dependencies of loci with string classification according to fitness differences. In Proceedings of the 2004 Genetic and Evolutionary Computation Conference, pages 246-257, 26-30 June 2004.