Information Technology Reference
In-Depth Information
17. Bowman, M., Briand, L.C., Labiche, Y.: Solving the Class Responsibility Assign-
ment Problem in Object-Oriented Analysis with Multi-Objective Genetic Algo-
rithms. Technical Report SCE-07-02, Carleton University (August. 2008)
18. Burgess, C.J., Lefley, M.: Can genetic programming improve software effort es-
timation? a comparative evaluation. Information and Software Technology 43,
863-873 (2001)
19. Burke, E., Kendall, G.: Search Methodologies. Introductory tutorials in optimiza-
tion and decision support techniques. Springer, Heidelberg (2005)
20. Chen, T.Y., Lau, M.F.: Heuristics towards the optimization of the size of a test
suite. In: Proceedings of the 3rd International Conference on Software Quality
Management, vol. 2, pp. 415-424 (1995)
21. Clark, J., Dolado, J.J., Harman, M., Hierons, R.M., Jones, B., Lumkin, M.,
Mitchell, B., Mancoridis, S., Rees, K., Roper, M., Shepperd, M.: Reformulating
software engineering as a search problem. IEE Proceedings — Software 150(3),
161-175 (2003)
22. Crescenzi, P., Kann, V. (eds.): A compendium of NP-optimization problems,
http://www.nada.kth.se/
23. Deb, K., Goldberg, D.: A comparative analysis of selection schemes used in genetic
algorithms. In: Foundations of Genetic Algorithms, pp. 69-93. Morgan Kaufmann,
San Francisco (1991)
24. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective
genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6,
182-197 (2002)
25. Dolado, J.J.: On the problem of the software cost function. Information and Soft-
ware Technology 43(1), 61-72 (2001)
26. Dolado, J.J.: A Validation of the Component-based Method for Software Size
Estimation. IEEE Transactions on Software Engineering 26(10), 1006-1021 (2000)
27. Durillo, J.J., Zhang, Y., Alba, E., Nebro, A.J.: A Study of the Multi-Objective
Next Release Problem. In: Proceedings of the 1st International Symposium on
Search Based Software Engineering (SSBSE 2009), Cumberland Lodge, Windsor,
UK, May 13-15, pp. 49-58. IEEE Computer Society Press (2009)
28. Elbaum, S.G., Malishevsky, A.G., Rothermel, G.: Prioritizing test cases for re-
gression testing. In: International Symposium on Software Testing and Analysis,
pp. 102-112. ACM Press (2000)
29. Fatiregun, D., Harman, M., Hierons, R.: Evolving transformation sequences us-
ing genetic algorithms. In: 4th International Workshop on Source Code Analysis
and Manipulation (SCAM 2004), pp. 65-74. IEEE Computer Society Press, Los
Alamitos (2004)
30. Fatiregun, D., Harman, M., Hierons, R.: Search-based amorphous slicing. In: 12th
International Working Conference on Reverse Engineering (WCRE 2005), pp. 3-
12. Carnegie Mellon University, Pittsburgh (2005)
31. Finkelstein, A., Harman, M., Afshin Mansouri, S., Ren, J., Zhang, Y.: “Fairness
Analysis” in Requirements Assignments. In: Proceedings of the 16th IEEE Inter-
national Requirements Engineering Conference (RE 2008), Barcelona, Catalunya,
Spain, September 8-12, pp. 115-124. IEEE Computer Society (2008)
32. Foster, I.: Designing and building parallel programs:Concepts and tools for par-
allel software. Addison-Wesley (1995)
33. Sapna, P.G., Mohanty, H.: Automated Test Scenario Selection Based on Lev-
enshtein Distance. In: Janowski, T., Mohanty, H. (eds.) ICDCIT 2010. LNCS,
vol. 5966, pp. 255-266. Springer, Heidelberg (2010)
 
Search WWH ::




Custom Search