Runtime analysis of (1+1) EA on computing unique input output sequences

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 1882-1889

  Lehre, Per Kristian ^a   Xin, Yao ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

PRACTICAL TECHNIQUES; RUNTIME ANALYSIS;

EVOLUTIONARY ALGORITHMS; OPERATIONS RESEARCH; PROBLEM SOLVING; RANDOM PROCESSES;

FINITE AUTOMATA;

EID: 58349088202     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424703     Document Type: Conference Paper

References (12)

1. J. Clarke, J. J. Dolado, M. Harman, R. Hierons, B. Jones, M. Lumkin, B. Mitchell, S. Mancoridis, K. Rees, M. Roper, and M. Shepperd. Reformulating software engineering as a search problem. IEE Proceedings-Software, 150(3):161-175, 2003.
2. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. McGraw Hill, New York, NY, 2nd edition, 2001.
3. Karnig Derderian, Robert M. Hierons, Mark Harman, and Qiang Guo. Automated unique input output sequence generation for conformance testing of fsms. The Computer Journal, 49(3):331-344, 2006.
4. Stefan Droste, Thomas Jansen, and Ingo Wegener. On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science, 276:51-81, 2002.
5. Stefan Droste, Thomas Jansen, and Ingo Wegener. Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 39(4):525-544, 2006.
6. Oliver Giel. Zur Analyse von randomisierten Suchheuristiken und Online-Heuristiken. PhD thesis, Universität Dortmund, 2005.
7. Q. Guo, R. M. Hierons, M. Harman, and K. Derderian. Computing unique input/output sequences using genetic algorithms. In Proceedings of the 3rd International Workshop on Formal Approaches to Testing of Software (FATES'2003), volume 2931 of LNCS, pages 164-177, 2004.
8. Jun He and Xin Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, 3(1):21-35, 2004.
9. D. Lee and M. Yannakakis. Testing finite-state machines: state identification and verification. IEEE Transactions on Computers, 43(3):306-320, 1994.
10. David Lee and Mihalis Yannakakis. Principles and methods of testing finite state machines-a survey. Proceedings of the IEEE, 84(8):1090-1123, 1996.
11. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
12. Heinz Mühlenbein. How genetic algorithms really work I. Mutation and Hillclimbing. In Proceedings of the Parallel Problem Solving from Nature 2, (PPSN-II), pages 15-26. Elsevier, 1992.