Approximation algorithms for software component selection problem

Proceedings - Asia-Pacific Software Engineering Conference, APSEC

Volumn , Issue , 2007, Pages 159-166

  Haghpanah, Nima ^a   Habibi, Jafar ^a   Moaven, Shahrouz ^a   Kargar, Mehdi ^a   Yeganeh, Soheil Hassas ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ARCHITECTURAL DESIGN; COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; COMPUTER SOFTWARE SELECTION AND EVALUATION; COST BENEFIT ANALYSIS; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; NUCLEAR PROPULSION; NUMERICAL METHODS; POLYNOMIAL APPROXIMATION; SET THEORY; SOFTWARE DESIGN; SOFTWARE ENGINEERING; TECHNOLOGY;

(ALGORITHMIC) COMPLEXITY; (E ,3E) PROCESS; ACTIVE X; ASIA PACIFIC; COMMERCIAL COMPONENTS; COMPLEX INTERACTIONS; COMPONENT SELECTION (CS); COMPONENT-BASED SOFTWARE ENGINEERING (CBSE); EFFICIENT ALGORITHMS; HIGH ORDER; HUMAN EXPERTS; MINIMAL COSTS; NP COMPLETE; SOFTWARE COMPONENTS; SOFTWARE DEVELOPING ORGANIZATIONS; SOFTWARE SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 44949142996     PISSN: 15301362     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APSEC.2007.26     Document Type: Conference Paper

References (27)

1. C. Albert and L. Brownsword. Evolutionary process for integrating cots-based systems (epic). CMU/SEI Technical Report CMU/SEI, 2002.
2. C. Alves and J. Castro. Cre: A systematic method for cots component selection. In Brazilian Symposium on Software Engineering, 2001.
3. K. Ballurio, B. Scalzo, and L. Rose. Risk reduction in cots software selection with basis. In Proc. ICCBSS, 2003.
4. R. Bartholet, D. Brogan, and P. Reynolds. The computational complexity of component selection in simulation reuse. In Proceedings of the 37th Conference on Winter Simulation, pages 2472-2481, 2005.
5. E Brooks. No silver bullet: Essence and accidents of software engineering. Computer, 20:10-19, 1987.
6. S. E. Carlson. Genetic algorithm attributes for component selection. Research in Engineering Design, 8(1):33-51, January 1996.
7. V. Chvatal. A greedy heuristic for the set covering problem. Mathematics of operations research, 4:233-235, 1979.
8. S. Comella-Dorda, J. Dean, G. Lewis, E. Morris, P. Oberndorf, and E. Harper. A process for cots software product evaluation. In Proc. ICCBSS, 2002.
9. M. Corporation. Visual Basic 5, Component Tools Guide. Microsoft Press, 1997.
10. M. Fox, D. Brogan, and P. Reynolds. Approximating component selection. ACM/IEEE Winter Simulation Conference, 2004.
11. D. Goldberg. Genetic algorithms in search, optimization and machine learning. MA: Addison-Wesley Publishing Co, 1989.
12. J. Holland. Adaptation in natural and artificial systems. Ann Arbor, MI: University of Michigan Press, 1975.
13. D. Johnson. Approxiation algorithms for combinatorial problems. Journal of Computer and System Sceinces, 9:256-278, January 1974.
14. D. Kruglinski, G. Shepherd, and S. Wingo. Programming Microsoft Visual C++. Microsoft Press, 1998.
15. G. E. Liepins, M. R. Hilliard, M. Palmer, and M. Monow. Greedy genetics. J. J. Grdenstettc, editor, Genetic Algorithm and Their Applications: Proceedings of the Snd Intemationd Conference on Genetic Algorithms, July 1987.
16. G. E. Liepins, M. R. Hilliard, J. Richardson, and M.Palmer. Genetic algorithms applications to set covercing and traveling salesman problems. Brown (ed), Operations Research and Artificial Intelligence: The Integration of ProblemSolving Stmtegies, Kluwer Academic Publishers, 1990.
17. L. Lovasz. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 31(7):383-390, Jan-uary 1975.
18. E. Mancebo and A. Andrews. A strategy for selecting multiple components. In Proc. ACM SAC, 2005.
19. Z. Michalewicz and C. Janikow. Genocop: a genetic algorithm for numerical optimization problems with linear constraints, commun. ACM 39, 1996.
20. C. Ncube and N. Maiden. Pore: Procurement-oriented requirements engineering method for the component based systems engineering development paradigm. In Int'l Conf. Software Eng. CBSE Workshop, 1999.
21. E. Page and J. M. Opper. Observations on the complexity of composable simulation. In Proceedings of the 1999 Winter Simulation Conference New York: ACM Press, pages 553-560, 1999.
22. C. H. Papadimitriou and K. Steiglitz. Combinatorial optimization: Algorithms and complexity. Dover, 1998.
23. K. S. Paul Baker, Mark Harman and A. Skaliotis. Search based approaches to component selection and prioritization for the next release problem. ICSM 2006, pages 176-185, 2006.
24. M. Petty, E. Weisel, and R. Mielke. Computational complexity of selecting components for composition. Proceedings of the Fall 2003 Simulation Interoperability Workshop, pages 14-19, September 2003.
25. S. Sen. Minimal set covering using probabilistic methods. In Proceedings of ACM/SIGAPP Symposium of Applied Computing, pages 157-164, 1993.
26. P. Slavik. A tight analysis of the greedy algorithm set cover. Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, 1996.
27. C. Szyperski. Component software: Beyond objectoriented programming. Addison-Wesley, Erewhon, NC, 2002.