Referenced Items are not available for this document.
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
- Page(s):
- 62 - 65
- Print ISBN:
- 978-1-4673-4651-1
- INSPEC Accession Number:
- 13243200
- Conference Location :
- Boca Raton, FL
- Digital Object Identifier :
- 10.1109/ICMLA.2012.194
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
