Content deleted Content added
Ohconfucius (talk | contribs) |
|||
Line 1:
{{Use dmy dates|date=November 2011}}
'''Search-based software engineering''' ('''SBSE''') is an approach to apply [[metaheuristic]] search techniques like [[genetic algorithms]], [[simulated annealing]] and [[tabu search]] to [[software engineering]] problems. It is inspired by the observation that many activities in [[software engineering]] can be formulated as [[Optimization (mathematics)|optimization]] problems. Due to the [[computational complexity]] of these problems, exact [[Optimization (mathematics)|optimization]] techniques of [[operations research]] like [[linear programming]] or [[dynamic programming]] are mostly impractical for large scale [[software engineering]] problems. Because of this, researchers and practitioners have used [[metaheuristic]] search techniques to find near optimal or good-enough solutions.
__TOC__
==Brief history==
One of the earliest attempts in applying [[Optimization (mathematics)|optimization]] to a [[software engineering]] problem was reported by [[Webb Miller]] and David Spooner in 1976 in the area of software testing.<ref>W. Miller and D. L. Spooner, Automatic Generation of Floating-Point Test Data, ''IEEE Transactions on Software Engineering'', Vol. 2, No. 3, pp.
==Application areas==
[[Software testing]] has been one of the major applications of search techniques in [[software engineering]].<ref>P. McMinn, Search-based software test data generation: a survey, ''Software Testing, Verification and Reliability'', Vol. 14, No. 2, pp.
The term ''[[Search-based application]]'', in contrast, refers to using [[search engine]] technology, rather than search techniques, in another industrial application.
==References==
{{reflist|colwidth=30em}}
==External links==
|