SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Theoretical Computer Science

Volumn 276, Issue 1-2, 2002, Pages 51-81

On the analysis of the (1 + 1) evolutionary algorithm

(3) Droste, Stefan a Jansen, Thomas a Wegener, Ingo a

a TU DORTMUND UNIVERSITY (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GENETIC ALGORITHMS; OPTIMIZATION; POLYNOMIALS; THEOREM PROVING;

LINEAR FUNCTIONS;

COMPUTER SCIENCE;

EID: 0037029331 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(01)00182-7 Document Type: Article

Times cited : (861)

References (19)

1
- 0003412386
- Kluwer Academic Publishers, Boston
- (1987) A Connectionist Machine for Genetic Hillclimbers
- Ackley, D.H.¹

2
- 0002471118
- Optimal mutation rates in genetic search
- S. Forrest (Ed.), Morgan Kaufman, San Mateo, CA
- (1993) Proc. 5th Internat. Conf. on Genetic Algorithms ICGA , pp. 2-8
- Bäck, Th.¹

3
- 0031647995
- A rigorous complexity analysis of the (1 + 1) Evolutionary Algorithm for linear functions with Boolean inputs
- IEEE Press, Piscataway, NJ
- (1998) Proc. IEEE Internat. Conf. on Evolutionary Computation ICEC '98 , pp. 499-504
- Droste, S.¹ Jansen, Th.² Wegener, I.³

4
- 0003421261
- Wiley, New York
- (1971) An Introduction to Probability Theory and its Applications , vol.2
- Feller, W.¹

5
- 0003929250
- IEEE Press, Piscataway, NJ
- (1995) Evolutionary Computation: Toward a New Philosophy of Machine Intelligence
- Fogel, D.B.¹

6
- 0001189325
- Rigorous hitting times for binary mutations
- (1999) Evolutionary Comput. , vol.7 , Issue.2 , pp. 167-203
- Garnier, J.¹ Kallel, L.² Schoenauer, M.³

7
- 0003722376
- Addison-Wesley, Reading, MA
- (1989) Genetic Algorithms in Search, Optimization, and Machine Learning
- Goldberg, D.E.¹

8
- 0003463297
- University of Michigan, Michigan
- (1975) Adaption in Natural and Artificial Systems
- Holland, J.H.¹

9
- 84986265197
- Long path problems
- Y. Davidor, H. -P. Schwefel, R. Männer (Eds.), Parallel Problem Solving from Nature PPSN III, Springer, Berlin
- (1994) Lecture Notes in Computer Science , vol.866 , pp. 149-158
- Horn, J.¹ Goldberg, D.E.² Deb, K.³

10
- 0001722513
- Hillclimbing as a baseline method for the evaluation of stochastic optimization algorithms
- D.S. Touretzky, et al. (Eds.), MIT Press, Cambridge, MA
- (1995) Advances in Neural Information Processing Systems , vol.8 , pp. 430-436
- Juels, A.¹ Wattenberg, M.²

11
- 26444479778
- Optimization by simulated annealing
- (1983) Science , vol.220 , pp. 671-680
- Kirkpatrick, S.¹ Gelatt, C.D.² Vecchi, M.P.³

12
- 0003882343
- MIT Press, Cambridge, MA
- (1992) Genetic Programming: On the Programming of Computers by means of Natural Selection
- Koza, J.R.¹

13
- 0008801609
- personal communication
- (1998)
- Menke, R.¹

14
- 0004168557
- Cambridge University Press, Cambridge
- (1995) Randomized Algorithms
- Motwani, R.¹ Raghavan, P.²

15
- 0002091030
- How genetic algorithms really work. Mutation and hill-climbing
- R. Männer, R. Manderick (Eds.), North-Holland, Amsterdam
- (1992) Parallel Problem Solving from Nature PPSN II , pp. 15-25
- Mühlenbein, H.¹

16
- 0003827650
- Frommann-Holzboog, Stuttgart
- (1994) Evolutionsstrategie '94
- Rechenberg, I.¹

17
- 0003690951
- Ph.D. Thesis, Verlag Dr. Kovač, Hamburg
- (1997) Convergence properties of evolutionary algorithms
- Rudolph, G.¹

18
- 0000066236
- How mutation and selection solve long-path problems in polynomial expected time
- (1997) Evolutionary Comput. , vol.4 , Issue.2 , pp. 195-205
- Rudolph, G.¹

19
- 0003636650
- Wiley, New York
- (1995) Evolution and Optimum Seeking
- Schwefel, H.-P.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.