By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Buzdalov, M. ; St. Petersburg Nat. Res. Univ. of Inf. Technol., Mech. & Opt., St. Petersburg, Russia

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.

Published in:

Machine Learning and Applications (ICMLA), 2012 11th International Conference on  (Volume:2 )

Date of Conference:

12-15 Dec. 2012