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.
| Original language | English |
|---|---|
| Title of host publication | ICMLA '12 |
| Subtitle of host publication | Proceedings of the 2012 11th International Conference on Machine Learning and Applications |
| Publisher | IEEE Press |
| Pages | 62-65 |
| Number of pages | 4 |
| Volume | 2 |
| ISBN (Print) | 978-1-4673-4651-1 |
| DOIs | |
| Publication status | Published - 12 Dec 2012 |
| Externally published | Yes |