Approximation Algorithms for Software Component Selection Problem

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

doi:10.1109/apsec.2007.26

Cited by 21 publications

(11 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Paper [19] proposes a comparison between a Greedy algorithm and a Genetic Algorithm. The discussed problem considers a realistic case in which cost of components may be different.…”

Section: Related Work Analysis and Discussionmentioning

confidence: 99%

Third Case Study for the Dynamic Multilevel Component Selection

Veșcan

2017

Studia UBB Informatica

View full text Add to dashboard Cite

Abstract. The architecture of a system changes after the deployment phase due to new requirements from the stakeholders. The software architect must make decisions about the selection of the right software components out of a range of choices to satisfy a set of requirements. This paper deals with the component selection problem with a multilevel system view in a dynamic environment.To validate our approach we have used the case study method. Three different case studies were performed but only one is presented in the current paper. The research design was conducted using a research question, propositions and for interpreting the study's findings we have used the Wilcoxon signed ranks statistical test. The tests performed show the potential of evolutionary algorithms for the dynamic multilevel component selection problem.

show abstract

“…Paper [19] proposes a comparison between a Greedy algorithm and a Genetic Algorithm. The discussed problem considers a realistic case in which cost of components may be different.…”

Section: Related Work Analysis and Discussionmentioning

confidence: 99%

Third Case Study for the Dynamic Multilevel Component Selection

Veșcan

2017

Studia UBB Informatica

View full text Add to dashboard Cite

show abstract

“…Haghpanah et al (2007) presented the problem of component selection and evaluation as NP-complete problem and proposed a method based on the greedy approach and the genetic algorithm by taking the computational complexity of this problem into account. Saltelli et al (2008) introduced the concept of sensitivity analysis which provides the basis for obtaining the useful information about the selection parameters which can contribute up to a large extent to the uncertainties in the output of the model.…”

Section: C2mentioning

confidence: 99%

Ranking and selection of commercial off-the-shelf using fuzzy distance based approach

Garg¹,

Sharma²,

Sharma³

2016

10.5267/j.dsl

View full text Add to dashboard Cite

“…Researchers and practitioners generally use the simple component selection problem and criteria based component selection problems. [7]- [9] A. Simple Component Selection Problem Simple Component Selection Problem (SCSP) is the problem of choosing a number of components from a set of components such that their composition satisfies a set of objectives [7], [8].…”

Section: Component Selection Problemsmentioning

confidence: 99%