Generation of Tests for Programming Challenge Tasks on Graph Theory Using Evolution Strategy

  • Authors:
  • Maxim Buzdalov

  • Affiliations:
  • -

  • Venue:
  • ICMLA '12 Proceedings of the 2012 11th International Conference on Machine Learning and Applications - Volume 02
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, an automated method for generation of tests against inefficient solutions for programming challenge tasks on graph theory is proposed. The method is based on the use of (1+1) evolution strategy and is able to defeat several kinds of inefficient solutions. The proposed method was applied to a task from the Internet problem archive, the Timus Online Judge.