Journal
FRONTIERS OF COMPUTER SCIENCE IN CHINA
Volume 3, Issue 1, Pages 64-72Publisher
HIGHER EDUCATION PRESS
DOI: 10.1007/s11704-009-0006-6
Keywords
software engineering; evolutionary algorithms; runtime analysis
Categories
Funding
- EPSRC [EP/C520696/1]
- Royal Society
- EPSRC [EP/D052785/1] Funding Source: UKRI
- Engineering and Physical Sciences Research Council [EP/D052785/1, EP/C520696/1] Funding Source: researchfish
Ask authors/readers for more resources
Many software engineering tasks can potentially be automated using search heuristics. However, much work is needed in designing and evaluating search heuristics before this approach can be routinely applied to a software engineering problem. Experimental methodology should be complemented with theoretical analysis to achieve this goal. Recently, there have been significant theoretical advances in the runtime analysis of evolutionary algorithms (EAs) and other search heuristics in other problem domains. We suggest that these methods could be transferred and adapted to gain insight into the behaviour of search heuristics on software engineering problems while automating software engineering.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available